./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-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:14:00,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:14:00,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:14:00,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:14:00,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:14:00,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:14:00,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:14:00,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:14:00,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:14:00,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:14:00,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:14:00,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:14:00,269 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:14:00,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:14:00,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:14:00,272 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:14:00,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:14:00,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:14:00,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:14:00,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:14:00,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:14:00,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:14:00,277 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:14:00,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:14:00,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:14:00,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:14:00,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:14:00,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:14:00,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:14:00,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:14:00,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:14:00,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:14:00,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:14:00,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:14:00,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:14:00,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:14:00,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:14:00,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:14:00,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:14:00,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:14:00,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:14:00,282 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 [2024-10-11 17:14:00,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:14:00,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:14:00,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:14:00,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:14:00,572 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:14:00,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2024-10-11 17:14:02,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:14:02,266 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:14:02,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2024-10-11 17:14:02,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff7730fac/fc6f284c8c7649ec829b86195179cf22/FLAGee9de55eb [2024-10-11 17:14:02,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff7730fac/fc6f284c8c7649ec829b86195179cf22 [2024-10-11 17:14:02,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:14:02,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:14:02,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:14:02,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:14:02,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:14:02,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:02,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac2cf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02, skipping insertion in model container [2024-10-11 17:14:02,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:02,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:14:02,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:14:02,909 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:14:02,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:14:02,966 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:14:02,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02 WrapperNode [2024-10-11 17:14:02,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:14:02,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:14:02,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:14:02,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:14:02,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:02,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,045 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 231 [2024-10-11 17:14:03,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:14:03,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:14:03,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:14:03,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:14:03,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:14:03,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:14:03,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:14:03,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:14:03,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (1/1) ... [2024-10-11 17:14:03,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:14:03,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:14:03,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:14:03,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:14:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:14:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:14:03,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:14:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:14:03,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:14:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:14:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:14:03,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:14:03,193 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:14:03,320 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:14:03,322 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:14:03,815 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:14:03,815 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:14:03,846 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:14:03,849 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:14:03,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:03 BoogieIcfgContainer [2024-10-11 17:14:03,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:14:03,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:14:03,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:14:03,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:14:03,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:14:02" (1/3) ... [2024-10-11 17:14:03,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b215bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:03, skipping insertion in model container [2024-10-11 17:14:03,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:02" (2/3) ... [2024-10-11 17:14:03,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b215bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:03, skipping insertion in model container [2024-10-11 17:14:03,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:03" (3/3) ... [2024-10-11 17:14:03,859 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2024-10-11 17:14:03,877 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:14:03,878 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-11 17:14:03,878 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:14:03,988 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:14:04,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 313 transitions, 640 flow [2024-10-11 17:14:04,150 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-10-11 17:14:04,151 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:14:04,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 311 events. 18/311 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 593 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 170. Up to 2 conditions per place. [2024-10-11 17:14:04,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 313 transitions, 640 flow [2024-10-11 17:14:04,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 291 transitions, 594 flow [2024-10-11 17:14:04,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:14:04,198 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;@4717d6c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:14:04,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-11 17:14:04,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:14:04,204 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-11 17:14:04,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:14:04,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:04,206 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-11 17:14:04,206 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-11 17:14:04,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1426550473, now seen corresponding path program 1 times [2024-10-11 17:14:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:04,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427406933] [2024-10-11 17:14:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427406933] [2024-10-11 17:14:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427406933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700311933] [2024-10-11 17:14:04,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:04,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:04,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:04,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:04,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2024-10-11 17:14:04,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:04,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:04,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2024-10-11 17:14:04,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:04,631 INFO L124 PetriNetUnfolderBase]: 17/369 cut-off events. [2024-10-11 17:14:04,632 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-10-11 17:14:04,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 369 events. 17/369 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1069 event pairs, 3 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 258. Up to 16 conditions per place. [2024-10-11 17:14:04,646 INFO L140 encePairwiseOnDemand]: 304/313 looper letters, 9 selfloop transitions, 2 changer transitions 2/284 dead transitions. [2024-10-11 17:14:04,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 602 flow [2024-10-11 17:14:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2024-10-11 17:14:04,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952076677316294 [2024-10-11 17:14:04,676 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 594 flow. Second operand 3 states and 894 transitions. [2024-10-11 17:14:04,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 602 flow [2024-10-11 17:14:04,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:14:04,688 INFO L231 Difference]: Finished difference. Result has 279 places, 282 transitions, 572 flow [2024-10-11 17:14:04,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=279, PETRI_TRANSITIONS=282} [2024-10-11 17:14:04,696 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -3 predicate places. [2024-10-11 17:14:04,697 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 282 transitions, 572 flow [2024-10-11 17:14:04,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:04,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:04,698 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-11 17:14:04,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:14:04,699 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-11 17:14:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1258392661, now seen corresponding path program 1 times [2024-10-11 17:14:04,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:04,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342082028] [2024-10-11 17:14:04,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:04,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342082028] [2024-10-11 17:14:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342082028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:04,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995988715] [2024-10-11 17:14:04,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:04,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:04,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:04,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2024-10-11 17:14:04,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 282 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:04,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:04,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2024-10-11 17:14:04,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:04,888 INFO L124 PetriNetUnfolderBase]: 18/413 cut-off events. [2024-10-11 17:14:04,889 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:14:04,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 413 events. 18/413 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1226 event pairs, 3 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 407. Up to 17 conditions per place. [2024-10-11 17:14:04,894 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-10-11 17:14:04,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 281 transitions, 592 flow [2024-10-11 17:14:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2024-10-11 17:14:04,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2024-10-11 17:14:04,899 INFO L175 Difference]: Start difference. First operand has 279 places, 282 transitions, 572 flow. Second operand 3 states and 888 transitions. [2024-10-11 17:14:04,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 281 transitions, 592 flow [2024-10-11 17:14:04,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:04,908 INFO L231 Difference]: Finished difference. Result has 276 places, 281 transitions, 570 flow [2024-10-11 17:14:04,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=276, PETRI_TRANSITIONS=281} [2024-10-11 17:14:04,909 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -6 predicate places. [2024-10-11 17:14:04,909 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 281 transitions, 570 flow [2024-10-11 17:14:04,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:04,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:04,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:04,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:14:04,911 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-11 17:14:04,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash -258362343, now seen corresponding path program 1 times [2024-10-11 17:14:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067033286] [2024-10-11 17:14:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:04,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067033286] [2024-10-11 17:14:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067033286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:04,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308152172] [2024-10-11 17:14:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:04,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:05,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:05,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 281 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:05,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:05,109 INFO L124 PetriNetUnfolderBase]: 27/518 cut-off events. [2024-10-11 17:14:05,110 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:14:05,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 518 events. 27/518 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2186 event pairs, 5 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 508. Up to 21 conditions per place. [2024-10-11 17:14:05,114 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-10-11 17:14:05,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 280 transitions, 592 flow [2024-10-11 17:14:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-10-11 17:14:05,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-10-11 17:14:05,117 INFO L175 Difference]: Start difference. First operand has 276 places, 281 transitions, 570 flow. Second operand 3 states and 886 transitions. [2024-10-11 17:14:05,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 280 transitions, 592 flow [2024-10-11 17:14:05,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 280 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:05,123 INFO L231 Difference]: Finished difference. Result has 275 places, 280 transitions, 568 flow [2024-10-11 17:14:05,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=275, PETRI_TRANSITIONS=280} [2024-10-11 17:14:05,125 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -7 predicate places. [2024-10-11 17:14:05,126 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 280 transitions, 568 flow [2024-10-11 17:14:05,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:05,127 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-11 17:14:05,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:14:05,128 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-11 17:14:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash 928634739, now seen corresponding path program 1 times [2024-10-11 17:14:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099430520] [2024-10-11 17:14:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:05,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:05,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099430520] [2024-10-11 17:14:05,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099430520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:05,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:05,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:05,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129429333] [2024-10-11 17:14:05,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:05,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:05,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:05,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:05,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:05,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:05,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 280 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:05,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:05,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:05,312 INFO L124 PetriNetUnfolderBase]: 23/429 cut-off events. [2024-10-11 17:14:05,313 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:14:05,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 429 events. 23/429 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1561 event pairs, 5 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 412. Up to 21 conditions per place. [2024-10-11 17:14:05,317 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-11 17:14:05,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 279 transitions, 590 flow [2024-10-11 17:14:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-10-11 17:14:05,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-10-11 17:14:05,321 INFO L175 Difference]: Start difference. First operand has 275 places, 280 transitions, 568 flow. Second operand 3 states and 886 transitions. [2024-10-11 17:14:05,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 279 transitions, 590 flow [2024-10-11 17:14:05,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 279 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:05,326 INFO L231 Difference]: Finished difference. Result has 274 places, 279 transitions, 566 flow [2024-10-11 17:14:05,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=274, PETRI_TRANSITIONS=279} [2024-10-11 17:14:05,329 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -8 predicate places. [2024-10-11 17:14:05,329 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 279 transitions, 566 flow [2024-10-11 17:14:05,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:05,331 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-11 17:14:05,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:14:05,332 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-11 17:14:05,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash -775813011, now seen corresponding path program 1 times [2024-10-11 17:14:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574605943] [2024-10-11 17:14:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574605943] [2024-10-11 17:14:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574605943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:05,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033139830] [2024-10-11 17:14:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:05,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:05,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:05,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:05,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:05,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 279 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:05,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:05,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:05,476 INFO L124 PetriNetUnfolderBase]: 22/422 cut-off events. [2024-10-11 17:14:05,477 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-10-11 17:14:05,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 422 events. 22/422 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1409 event pairs, 5 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 397. Up to 22 conditions per place. [2024-10-11 17:14:05,482 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-10-11 17:14:05,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 278 transitions, 588 flow [2024-10-11 17:14:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-10-11 17:14:05,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-10-11 17:14:05,485 INFO L175 Difference]: Start difference. First operand has 274 places, 279 transitions, 566 flow. Second operand 3 states and 886 transitions. [2024-10-11 17:14:05,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 278 transitions, 588 flow [2024-10-11 17:14:05,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 278 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:05,490 INFO L231 Difference]: Finished difference. Result has 273 places, 278 transitions, 564 flow [2024-10-11 17:14:05,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=273, PETRI_TRANSITIONS=278} [2024-10-11 17:14:05,492 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -9 predicate places. [2024-10-11 17:14:05,493 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 278 transitions, 564 flow [2024-10-11 17:14:05,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:05,494 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-11 17:14:05,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:14:05,495 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-11 17:14:05,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1604001172, now seen corresponding path program 1 times [2024-10-11 17:14:05,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:05,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525169619] [2024-10-11 17:14:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:05,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:05,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:05,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525169619] [2024-10-11 17:14:05,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525169619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:05,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:05,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:05,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711939111] [2024-10-11 17:14:05,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:05,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:05,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:05,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:05,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:05,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 278 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:05,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:05,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:05,702 INFO L124 PetriNetUnfolderBase]: 26/507 cut-off events. [2024-10-11 17:14:05,702 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:14:05,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 507 events. 26/507 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2012 event pairs, 5 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 475. Up to 22 conditions per place. [2024-10-11 17:14:05,707 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-10-11 17:14:05,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 586 flow [2024-10-11 17:14:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-10-11 17:14:05,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-10-11 17:14:05,713 INFO L175 Difference]: Start difference. First operand has 273 places, 278 transitions, 564 flow. Second operand 3 states and 886 transitions. [2024-10-11 17:14:05,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 586 flow [2024-10-11 17:14:05,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:05,720 INFO L231 Difference]: Finished difference. Result has 272 places, 277 transitions, 562 flow [2024-10-11 17:14:05,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=272, PETRI_TRANSITIONS=277} [2024-10-11 17:14:05,722 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -10 predicate places. [2024-10-11 17:14:05,723 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 277 transitions, 562 flow [2024-10-11 17:14:05,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:05,724 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-11 17:14:05,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:14:05,725 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-11 17:14:05,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash -633730726, now seen corresponding path program 1 times [2024-10-11 17:14:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:05,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472914615] [2024-10-11 17:14:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:05,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:05,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:05,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472914615] [2024-10-11 17:14:05,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472914615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:05,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:05,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:05,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247053064] [2024-10-11 17:14:05,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:05,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:05,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:05,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:05,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:05,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 277 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:05,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:05,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:05,898 INFO L124 PetriNetUnfolderBase]: 48/722 cut-off events. [2024-10-11 17:14:05,899 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:14:05,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 722 events. 48/722 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3773 event pairs, 8 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 698. Up to 36 conditions per place. [2024-10-11 17:14:05,903 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2024-10-11 17:14:05,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 278 transitions, 595 flow [2024-10-11 17:14:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2024-10-11 17:14:05,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2024-10-11 17:14:05,906 INFO L175 Difference]: Start difference. First operand has 272 places, 277 transitions, 562 flow. Second operand 3 states and 891 transitions. [2024-10-11 17:14:05,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 278 transitions, 595 flow [2024-10-11 17:14:05,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:05,911 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 573 flow [2024-10-11 17:14:05,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-10-11 17:14:05,912 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-10-11 17:14:05,912 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 573 flow [2024-10-11 17:14:05,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:05,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:05,914 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:05,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:14:05,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:05,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:05,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1204903880, now seen corresponding path program 1 times [2024-10-11 17:14:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:05,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094458290] [2024-10-11 17:14:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:05,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094458290] [2024-10-11 17:14:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094458290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:05,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:05,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226333712] [2024-10-11 17:14:05,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:05,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:06,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:06,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:06,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:06,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:06,091 INFO L124 PetriNetUnfolderBase]: 50/743 cut-off events. [2024-10-11 17:14:06,092 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-10-11 17:14:06,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 743 events. 50/743 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4003 event pairs, 8 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 653. Up to 36 conditions per place. [2024-10-11 17:14:06,096 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2024-10-11 17:14:06,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 278 transitions, 606 flow [2024-10-11 17:14:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2024-10-11 17:14:06,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2024-10-11 17:14:06,099 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 573 flow. Second operand 3 states and 891 transitions. [2024-10-11 17:14:06,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 278 transitions, 606 flow [2024-10-11 17:14:06,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:06,105 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 588 flow [2024-10-11 17:14:06,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-10-11 17:14:06,106 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-10-11 17:14:06,106 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 588 flow [2024-10-11 17:14:06,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:06,109 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-11 17:14:06,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:14:06,109 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:06,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2044432989, now seen corresponding path program 1 times [2024-10-11 17:14:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:06,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683349419] [2024-10-11 17:14:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:06,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683349419] [2024-10-11 17:14:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683349419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:06,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820259442] [2024-10-11 17:14:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:06,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:06,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:06,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:06,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:06,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:06,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:06,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:06,305 INFO L124 PetriNetUnfolderBase]: 56/962 cut-off events. [2024-10-11 17:14:06,306 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2024-10-11 17:14:06,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 962 events. 56/962 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5988 event pairs, 4 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 879. Up to 55 conditions per place. [2024-10-11 17:14:06,314 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/280 dead transitions. [2024-10-11 17:14:06,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 280 transitions, 631 flow [2024-10-11 17:14:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2024-10-11 17:14:06,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2024-10-11 17:14:06,318 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 588 flow. Second operand 3 states and 893 transitions. [2024-10-11 17:14:06,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 280 transitions, 631 flow [2024-10-11 17:14:06,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 280 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:06,323 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 603 flow [2024-10-11 17:14:06,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-10-11 17:14:06,324 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-10-11 17:14:06,324 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 603 flow [2024-10-11 17:14:06,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:06,326 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-11 17:14:06,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:14:06,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:06,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash -294538650, now seen corresponding path program 1 times [2024-10-11 17:14:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251005089] [2024-10-11 17:14:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:06,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251005089] [2024-10-11 17:14:06,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251005089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:06,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:06,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623582217] [2024-10-11 17:14:06,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:06,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:06,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:06,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:06,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2024-10-11 17:14:06,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:06,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2024-10-11 17:14:06,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:06,509 INFO L124 PetriNetUnfolderBase]: 42/793 cut-off events. [2024-10-11 17:14:06,510 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2024-10-11 17:14:06,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 793 events. 42/793 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4526 event pairs, 4 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 727. Up to 25 conditions per place. [2024-10-11 17:14:06,513 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-10-11 17:14:06,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 277 transitions, 628 flow [2024-10-11 17:14:06,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-10-11 17:14:06,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2024-10-11 17:14:06,517 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 603 flow. Second operand 3 states and 892 transitions. [2024-10-11 17:14:06,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 277 transitions, 628 flow [2024-10-11 17:14:06,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 277 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:06,523 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 605 flow [2024-10-11 17:14:06,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2024-10-11 17:14:06,525 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2024-10-11 17:14:06,525 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 605 flow [2024-10-11 17:14:06,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:06,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:06,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:14:06,527 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-11 17:14:06,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1228796145, now seen corresponding path program 1 times [2024-10-11 17:14:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:06,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297060506] [2024-10-11 17:14:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:06,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-11 17:14:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297060506] [2024-10-11 17:14:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297060506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:06,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593468787] [2024-10-11 17:14:06,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:06,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:06,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:06,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:06,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:06,711 INFO L124 PetriNetUnfolderBase]: 60/1068 cut-off events. [2024-10-11 17:14:06,711 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-10-11 17:14:06,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1068 events. 60/1068 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7055 event pairs, 6 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1022. Up to 47 conditions per place. [2024-10-11 17:14:06,718 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/279 dead transitions. [2024-10-11 17:14:06,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 279 transitions, 648 flow [2024-10-11 17:14:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2024-10-11 17:14:06,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2024-10-11 17:14:06,721 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 605 flow. Second operand 3 states and 893 transitions. [2024-10-11 17:14:06,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 279 transitions, 648 flow [2024-10-11 17:14:06,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 279 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:06,727 INFO L231 Difference]: Finished difference. Result has 269 places, 276 transitions, 616 flow [2024-10-11 17:14:06,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=269, PETRI_TRANSITIONS=276} [2024-10-11 17:14:06,728 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2024-10-11 17:14:06,728 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 276 transitions, 616 flow [2024-10-11 17:14:06,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:06,730 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] [2024-10-11 17:14:06,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:14:06,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:06,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1090064911, now seen corresponding path program 1 times [2024-10-11 17:14:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:06,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289947737] [2024-10-11 17:14:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:06,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:06,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289947737] [2024-10-11 17:14:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289947737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620527957] [2024-10-11 17:14:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:06,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:06,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:06,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:06,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2024-10-11 17:14:06,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 276 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:06,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2024-10-11 17:14:06,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:06,926 INFO L124 PetriNetUnfolderBase]: 45/1163 cut-off events. [2024-10-11 17:14:06,926 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2024-10-11 17:14:06,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1163 events. 45/1163 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7236 event pairs, 2 based on Foata normal form. 0/1055 useless extension candidates. Maximal degree in co-relation 1095. Up to 42 conditions per place. [2024-10-11 17:14:06,932 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-11 17:14:06,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 279 transitions, 653 flow [2024-10-11 17:14:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-10-11 17:14:06,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2024-10-11 17:14:06,935 INFO L175 Difference]: Start difference. First operand has 269 places, 276 transitions, 616 flow. Second operand 3 states and 898 transitions. [2024-10-11 17:14:06,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 279 transitions, 653 flow [2024-10-11 17:14:06,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 279 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:06,940 INFO L231 Difference]: Finished difference. Result has 270 places, 276 transitions, 626 flow [2024-10-11 17:14:06,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=270, PETRI_TRANSITIONS=276} [2024-10-11 17:14:06,941 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-10-11 17:14:06,941 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 276 transitions, 626 flow [2024-10-11 17:14:06,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:06,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:06,942 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] [2024-10-11 17:14:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:14:06,942 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash -419615918, now seen corresponding path program 1 times [2024-10-11 17:14:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293874097] [2024-10-11 17:14:06,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:06,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293874097] [2024-10-11 17:14:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293874097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:06,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:06,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:06,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723727950] [2024-10-11 17:14:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:06,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:06,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:06,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:06,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:07,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2024-10-11 17:14:07,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 276 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:07,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:07,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2024-10-11 17:14:07,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:07,122 INFO L124 PetriNetUnfolderBase]: 46/1201 cut-off events. [2024-10-11 17:14:07,122 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2024-10-11 17:14:07,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1201 events. 46/1201 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7646 event pairs, 4 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1156. Up to 43 conditions per place. [2024-10-11 17:14:07,130 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-11 17:14:07,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 279 transitions, 663 flow [2024-10-11 17:14:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-10-11 17:14:07,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2024-10-11 17:14:07,133 INFO L175 Difference]: Start difference. First operand has 270 places, 276 transitions, 626 flow. Second operand 3 states and 898 transitions. [2024-10-11 17:14:07,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 279 transitions, 663 flow [2024-10-11 17:14:07,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 279 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:07,139 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 636 flow [2024-10-11 17:14:07,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2024-10-11 17:14:07,141 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2024-10-11 17:14:07,142 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 636 flow [2024-10-11 17:14:07,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:07,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:07,143 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] [2024-10-11 17:14:07,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:14:07,143 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-11 17:14:07,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1794766840, now seen corresponding path program 1 times [2024-10-11 17:14:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:07,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472586177] [2024-10-11 17:14:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:07,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472586177] [2024-10-11 17:14:07,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472586177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:07,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:07,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865197731] [2024-10-11 17:14:07,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:07,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:07,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:07,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:07,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:07,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2024-10-11 17:14:07,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:07,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:07,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2024-10-11 17:14:07,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:07,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,315 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-11 17:14:07,315 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,315 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-11 17:14:07,315 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][139], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,319 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-11 17:14:07,319 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-11 17:14:07,319 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,319 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,321 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,321 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-11 17:14:07,321 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,321 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-11 17:14:07,321 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-11 17:14:07,321 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 164#L50-41true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,323 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-11 17:14:07,323 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:14:07,323 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,323 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 53#L50-42true, Black: 327#true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,325 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2024-10-11 17:14:07,325 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-11 17:14:07,325 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-11 17:14:07,325 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-11 17:14:07,328 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][139], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 109#L50-40true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,329 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-10-11 17:14:07,329 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2024-10-11 17:14:07,329 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-11 17:14:07,329 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-11 17:14:07,329 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-11 17:14:07,329 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,330 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-11 17:14:07,330 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:14:07,330 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,330 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,330 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-11 17:14:07,331 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 53#L50-42true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,331 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-11 17:14:07,331 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-11 17:14:07,331 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-11 17:14:07,332 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-11 17:14:07,332 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-11 17:14:07,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, 99#L52true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,333 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-10-11 17:14:07,334 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-11 17:14:07,334 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-11 17:14:07,334 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,336 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, 99#L52true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,336 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,336 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-11 17:14:07,336 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-11 17:14:07,336 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-11 17:14:07,336 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-11 17:14:07,341 INFO L124 PetriNetUnfolderBase]: 71/1065 cut-off events. [2024-10-11 17:14:07,341 INFO L125 PetriNetUnfolderBase]: For 42/45 co-relation queries the response was YES. [2024-10-11 17:14:07,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1065 events. 71/1065 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6389 event pairs, 6 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1123. Up to 88 conditions per place. [2024-10-11 17:14:07,348 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-10-11 17:14:07,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 276 transitions, 661 flow [2024-10-11 17:14:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-10-11 17:14:07,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2024-10-11 17:14:07,351 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 636 flow. Second operand 3 states and 892 transitions. [2024-10-11 17:14:07,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 276 transitions, 661 flow [2024-10-11 17:14:07,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 276 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:07,357 INFO L231 Difference]: Finished difference. Result has 272 places, 275 transitions, 638 flow [2024-10-11 17:14:07,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=272, PETRI_TRANSITIONS=275} [2024-10-11 17:14:07,358 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -10 predicate places. [2024-10-11 17:14:07,358 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 275 transitions, 638 flow [2024-10-11 17:14:07,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:07,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:07,359 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] [2024-10-11 17:14:07,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:14:07,360 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-11 17:14:07,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:07,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1865615290, now seen corresponding path program 1 times [2024-10-11 17:14:07,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625656794] [2024-10-11 17:14:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625656794] [2024-10-11 17:14:07,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625656794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:07,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:07,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:07,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536242126] [2024-10-11 17:14:07,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:07,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:07,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:07,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:07,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 275 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:07,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:07,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:07,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:07,559 INFO L124 PetriNetUnfolderBase]: 43/1137 cut-off events. [2024-10-11 17:14:07,560 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2024-10-11 17:14:07,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 1137 events. 43/1137 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7051 event pairs, 3 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1161. Up to 30 conditions per place. [2024-10-11 17:14:07,565 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 10 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2024-10-11 17:14:07,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 272 transitions, 654 flow [2024-10-11 17:14:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2024-10-11 17:14:07,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446219382321619 [2024-10-11 17:14:07,568 INFO L175 Difference]: Start difference. First operand has 272 places, 275 transitions, 638 flow. Second operand 3 states and 887 transitions. [2024-10-11 17:14:07,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 272 transitions, 654 flow [2024-10-11 17:14:07,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 272 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:07,573 INFO L231 Difference]: Finished difference. Result has 269 places, 272 transitions, 630 flow [2024-10-11 17:14:07,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=269, PETRI_TRANSITIONS=272} [2024-10-11 17:14:07,574 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2024-10-11 17:14:07,574 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 272 transitions, 630 flow [2024-10-11 17:14:07,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:07,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:07,575 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] [2024-10-11 17:14:07,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:14:07,576 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-11 17:14:07,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1871924535, now seen corresponding path program 1 times [2024-10-11 17:14:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:07,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091448124] [2024-10-11 17:14:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:07,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:07,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091448124] [2024-10-11 17:14:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091448124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:07,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:07,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123461620] [2024-10-11 17:14:07,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:07,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:07,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:07,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-11 17:14:07,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 272 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:07,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:07,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-11 17:14:07,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:07,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,739 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-11 17:14:07,739 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,739 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,739 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:14:07,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([801] L50-40-->L50-41: Formula: (= |v_#race~result_7~0_1| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][144], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,744 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-11 17:14:07,744 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:14:07,744 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,744 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,746 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,746 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-11 17:14:07,746 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,746 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:14:07,746 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:14:07,746 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-11 17:14:07,752 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([801] L50-40-->L50-41: Formula: (= |v_#race~result_7~0_1| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][144], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-11 17:14:07,752 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event [2024-10-11 17:14:07,752 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-11 17:14:07,752 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-10-11 17:14:07,752 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-10-11 17:14:07,752 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2024-10-11 17:14:07,762 INFO L124 PetriNetUnfolderBase]: 47/1092 cut-off events. [2024-10-11 17:14:07,762 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2024-10-11 17:14:07,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1092 events. 47/1092 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6278 event pairs, 3 based on Foata normal form. 3/1031 useless extension candidates. Maximal degree in co-relation 1078. Up to 47 conditions per place. [2024-10-11 17:14:07,766 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 0 selfloop transitions, 0 changer transitions 271/271 dead transitions. [2024-10-11 17:14:07,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 271 transitions, 652 flow [2024-10-11 17:14:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2024-10-11 17:14:07,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2024-10-11 17:14:07,769 INFO L175 Difference]: Start difference. First operand has 269 places, 272 transitions, 630 flow. Second operand 3 states and 888 transitions. [2024-10-11 17:14:07,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 271 transitions, 652 flow [2024-10-11 17:14:07,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 271 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:14:07,773 INFO L231 Difference]: Finished difference. Result has 267 places, 0 transitions, 0 flow [2024-10-11 17:14:07,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=267, PETRI_TRANSITIONS=0} [2024-10-11 17:14:07,773 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -15 predicate places. [2024-10-11 17:14:07,773 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 0 transitions, 0 flow [2024-10-11 17:14:07,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:07,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-10-11 17:14:07,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-10-11 17:14:07,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-10-11 17:14:07,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-10-11 17:14:07,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-10-11 17:14:07,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-10-11 17:14:07,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-10-11 17:14:07,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-10-11 17:14:07,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-10-11 17:14:07,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-10-11 17:14:07,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-10-11 17:14:07,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-10-11 17:14:07,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-10-11 17:14:07,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-10-11 17:14:07,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-10-11 17:14:07,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-10-11 17:14:07,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-10-11 17:14:07,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-10-11 17:14:07,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-10-11 17:14:07,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-10-11 17:14:07,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-10-11 17:14:07,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-10-11 17:14:07,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-10-11 17:14:07,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-10-11 17:14:07,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-10-11 17:14:07,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-10-11 17:14:07,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-10-11 17:14:07,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-10-11 17:14:07,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-10-11 17:14:07,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-10-11 17:14:07,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-10-11 17:14:07,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-10-11 17:14:07,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-10-11 17:14:07,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-10-11 17:14:07,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-10-11 17:14:07,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-10-11 17:14:07,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-10-11 17:14:07,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-10-11 17:14:07,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-10-11 17:14:07,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-10-11 17:14:07,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:14:07,783 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:07,789 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:14:07,789 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:14:07,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:14:07 BasicIcfg [2024-10-11 17:14:07,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:14:07,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:14:07,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:14:07,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:14:07,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:03" (3/4) ... [2024-10-11 17:14:07,796 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:14:07,799 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:14:07,800 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:14:07,804 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 17:14:07,805 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:14:07,805 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:14:07,806 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:14:07,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:14:07,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:14:07,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:14:07,900 INFO L158 Benchmark]: Toolchain (without parser) took 5246.88ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 94.8MB in the beginning and 57.6MB in the end (delta: 37.2MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-10-11 17:14:07,902 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 100.7MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:14:07,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.87ms. Allocated memory is still 161.5MB. Free memory was 94.6MB in the beginning and 132.6MB in the end (delta: -38.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-10-11 17:14:07,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.19ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:07,903 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 161.5MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:07,903 INFO L158 Benchmark]: RCFGBuilder took 769.15ms. Allocated memory is still 161.5MB. Free memory was 128.4MB in the beginning and 105.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:07,903 INFO L158 Benchmark]: TraceAbstraction took 3942.87ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 104.5MB in the beginning and 63.9MB in the end (delta: 40.6MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2024-10-11 17:14:07,903 INFO L158 Benchmark]: Witness Printer took 105.29ms. Allocated memory is still 197.1MB. Free memory was 63.9MB in the beginning and 57.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:14:07,905 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.11ms. Allocated memory is still 100.7MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.87ms. Allocated memory is still 161.5MB. Free memory was 94.6MB in the beginning and 132.6MB in the end (delta: -38.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.19ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 161.5MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 769.15ms. Allocated memory is still 161.5MB. Free memory was 128.4MB in the beginning and 105.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3942.87ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 104.5MB in the beginning and 63.9MB in the end (delta: 40.6MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 105.29ms. Allocated memory is still 197.1MB. Free memory was 63.9MB in the beginning and 57.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 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: 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: 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: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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, 448 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: 3.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 106 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=638occurred in iteration=14, InterpolantAutomatonStates: 48, 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.8s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-11 17:14:07,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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