./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-time-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afd4dff22cd4af07bd40593cdae3d07b68e9e49be619064a67ffd75ffa5bf4b2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:58:16,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:58:16,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:58:16,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:58:16,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:58:16,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:58:16,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:58:16,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:58:16,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:58:16,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:58:16,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:58:16,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:58:16,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:58:16,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:58:16,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:58:16,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:58:16,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:58:16,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:58:16,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:58:16,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:58:16,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:58:16,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:58:16,982 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:58:16,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:58:16,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:58:16,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:58:16,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:58:16,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:58:16,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:58:16,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:58:16,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:58:16,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:16,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:58:16,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:58:16,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:58:16,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:58:16,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:58:16,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:58:16,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:58:16,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:58:16,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:58:16,991 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> afd4dff22cd4af07bd40593cdae3d07b68e9e49be619064a67ffd75ffa5bf4b2 [2024-10-13 09:58:17,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:58:17,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:58:17,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:58:17,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:58:17,275 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:58:17,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-symm.wvr.c [2024-10-13 09:58:18,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:58:18,977 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:58:18,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-symm.wvr.c [2024-10-13 09:58:18,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef28ae2c2/d1443130438d4ec6b3458fe04db355bd/FLAG88847d99f [2024-10-13 09:58:19,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef28ae2c2/d1443130438d4ec6b3458fe04db355bd [2024-10-13 09:58:19,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:58:19,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:58:19,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:19,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:58:19,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:58:19,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e015b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19, skipping insertion in model container [2024-10-13 09:58:19,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:58:19,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:19,241 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:58:19,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:19,284 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:58:19,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19 WrapperNode [2024-10-13 09:58:19,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:19,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:19,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:58:19,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:58:19,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,334 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 10, calls inlined = 16, statements flattened = 225 [2024-10-13 09:58:19,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:19,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:58:19,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:58:19,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:58:19,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:58:19,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:58:19,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:58:19,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:58:19,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (1/1) ... [2024-10-13 09:58:19,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:58:19,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:58:19,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:58:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:58:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:58:19,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:58:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:58:19,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:58:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:58:19,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 09:58:19,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 09:58:19,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:58:19,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:58:19,479 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:58:19,575 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:58:19,577 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:58:19,957 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:58:19,958 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:58:20,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:58:20,319 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 09:58:20,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:20 BoogieIcfgContainer [2024-10-13 09:58:20,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:58:20,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:58:20,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:58:20,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:58:20,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:58:19" (1/3) ... [2024-10-13 09:58:20,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0597c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:20, skipping insertion in model container [2024-10-13 09:58:20,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19" (2/3) ... [2024-10-13 09:58:20,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0597c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:20, skipping insertion in model container [2024-10-13 09:58:20,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:20" (3/3) ... [2024-10-13 09:58:20,327 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-time-symm.wvr.c [2024-10-13 09:58:20,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:58:20,344 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-13 09:58:20,344 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:58:20,409 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 09:58:20,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 148 transitions, 310 flow [2024-10-13 09:58:20,519 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2024-10-13 09:58:20,519 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:20,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 146 events. 3/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 113 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2024-10-13 09:58:20,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 148 transitions, 310 flow [2024-10-13 09:58:20,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 124 transitions, 260 flow [2024-10-13 09:58:20,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:58:20,549 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;@3fbb2cc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:58:20,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-13 09:58:20,560 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:58:20,561 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-13 09:58:20,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:58:20,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:20,563 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] [2024-10-13 09:58:20,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:58:20,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1372999748, now seen corresponding path program 1 times [2024-10-13 09:58:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:20,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111657505] [2024-10-13 09:58:20,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111657505] [2024-10-13 09:58:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111657505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:20,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:20,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326624038] [2024-10-13 09:58:20,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:20,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:20,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:20,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-10-13 09:58:20,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 124 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:20,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:20,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-10-13 09:58:20,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:20,926 INFO L124 PetriNetUnfolderBase]: 4/117 cut-off events. [2024-10-13 09:58:20,930 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:58:20,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 117 events. 4/117 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 3 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 35. Up to 16 conditions per place. [2024-10-13 09:58:20,932 INFO L140 encePairwiseOnDemand]: 129/148 looper letters, 9 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-10-13 09:58:20,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 107 transitions, 248 flow [2024-10-13 09:58:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-10-13 09:58:20,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8536036036036037 [2024-10-13 09:58:20,951 INFO L175 Difference]: Start difference. First operand has 130 places, 124 transitions, 260 flow. Second operand 3 states and 379 transitions. [2024-10-13 09:58:20,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 107 transitions, 248 flow [2024-10-13 09:58:20,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 107 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 09:58:20,978 INFO L231 Difference]: Finished difference. Result has 111 places, 107 transitions, 222 flow [2024-10-13 09:58:20,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=111, PETRI_TRANSITIONS=107} [2024-10-13 09:58:20,986 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -19 predicate places. [2024-10-13 09:58:20,987 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 107 transitions, 222 flow [2024-10-13 09:58:20,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:20,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:20,989 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] [2024-10-13 09:58:20,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:58:20,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:58:20,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1631060643, now seen corresponding path program 1 times [2024-10-13 09:58:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104086755] [2024-10-13 09:58:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104086755] [2024-10-13 09:58:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104086755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:21,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967720779] [2024-10-13 09:58:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:21,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:21,083 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-10-13 09:58:21,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:21,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-10-13 09:58:21,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:21,130 INFO L124 PetriNetUnfolderBase]: 4/116 cut-off events. [2024-10-13 09:58:21,130 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:21,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 116 events. 4/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 3 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 111. Up to 16 conditions per place. [2024-10-13 09:58:21,133 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 9 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2024-10-13 09:58:21,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 242 flow [2024-10-13 09:58:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-10-13 09:58:21,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8175675675675675 [2024-10-13 09:58:21,139 INFO L175 Difference]: Start difference. First operand has 111 places, 107 transitions, 222 flow. Second operand 3 states and 363 transitions. [2024-10-13 09:58:21,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 242 flow [2024-10-13 09:58:21,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 106 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:21,144 INFO L231 Difference]: Finished difference. Result has 110 places, 106 transitions, 220 flow [2024-10-13 09:58:21,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2024-10-13 09:58:21,145 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -20 predicate places. [2024-10-13 09:58:21,145 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 220 flow [2024-10-13 09:58:21,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:21,146 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] [2024-10-13 09:58:21,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:58:21,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:58:21,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:21,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2094110082, now seen corresponding path program 1 times [2024-10-13 09:58:21,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054783302] [2024-10-13 09:58:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054783302] [2024-10-13 09:58:21,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054783302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:21,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:21,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928214193] [2024-10-13 09:58:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:21,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:21,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:21,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:21,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-10-13 09:58:21,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:21,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-10-13 09:58:21,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:21,268 INFO L124 PetriNetUnfolderBase]: 4/115 cut-off events. [2024-10-13 09:58:21,268 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:21,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 115 events. 4/115 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 3 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 102. Up to 16 conditions per place. [2024-10-13 09:58:21,269 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 9 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2024-10-13 09:58:21,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 240 flow [2024-10-13 09:58:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-10-13 09:58:21,275 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8175675675675675 [2024-10-13 09:58:21,275 INFO L175 Difference]: Start difference. First operand has 110 places, 106 transitions, 220 flow. Second operand 3 states and 363 transitions. [2024-10-13 09:58:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 240 flow [2024-10-13 09:58:21,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:21,279 INFO L231 Difference]: Finished difference. Result has 109 places, 105 transitions, 218 flow [2024-10-13 09:58:21,280 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=109, PETRI_TRANSITIONS=105} [2024-10-13 09:58:21,280 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -21 predicate places. [2024-10-13 09:58:21,280 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 105 transitions, 218 flow [2024-10-13 09:58:21,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:21,281 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:21,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:58:21,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:58:21,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:21,282 INFO L85 PathProgramCache]: Analyzing trace with hash 874583614, now seen corresponding path program 1 times [2024-10-13 09:58:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:21,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799188581] [2024-10-13 09:58:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799188581] [2024-10-13 09:58:21,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799188581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:21,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:21,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470662973] [2024-10-13 09:58:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:21,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:21,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-10-13 09:58:21,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 105 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:21,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-10-13 09:58:21,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:21,411 INFO L124 PetriNetUnfolderBase]: 4/114 cut-off events. [2024-10-13 09:58:21,411 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:21,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 114 events. 4/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 3 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 93. Up to 16 conditions per place. [2024-10-13 09:58:21,412 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 9 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2024-10-13 09:58:21,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 238 flow [2024-10-13 09:58:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-10-13 09:58:21,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8175675675675675 [2024-10-13 09:58:21,415 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 218 flow. Second operand 3 states and 363 transitions. [2024-10-13 09:58:21,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 238 flow [2024-10-13 09:58:21,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 104 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:21,418 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 216 flow [2024-10-13 09:58:21,419 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-10-13 09:58:21,419 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -22 predicate places. [2024-10-13 09:58:21,419 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 216 flow [2024-10-13 09:58:21,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:21,422 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] [2024-10-13 09:58:21,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:58:21,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:58:21,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash -708594043, now seen corresponding path program 1 times [2024-10-13 09:58:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538094291] [2024-10-13 09:58:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:21,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538094291] [2024-10-13 09:58:21,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538094291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:21,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:21,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:21,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389568127] [2024-10-13 09:58:21,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:21,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:21,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:21,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:21,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:21,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 148 [2024-10-13 09:58:21,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:21,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 148 [2024-10-13 09:58:21,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:21,557 INFO L124 PetriNetUnfolderBase]: 4/113 cut-off events. [2024-10-13 09:58:21,557 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:21,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 113 events. 4/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 3 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 86. Up to 18 conditions per place. [2024-10-13 09:58:21,558 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 11 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2024-10-13 09:58:21,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 103 transitions, 240 flow [2024-10-13 09:58:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2024-10-13 09:58:21,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8085585585585585 [2024-10-13 09:58:21,561 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 216 flow. Second operand 3 states and 359 transitions. [2024-10-13 09:58:21,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 103 transitions, 240 flow [2024-10-13 09:58:21,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 103 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:21,565 INFO L231 Difference]: Finished difference. Result has 107 places, 103 transitions, 214 flow [2024-10-13 09:58:21,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=107, PETRI_TRANSITIONS=103} [2024-10-13 09:58:21,566 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -23 predicate places. [2024-10-13 09:58:21,566 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 214 flow [2024-10-13 09:58:21,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:21,567 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] [2024-10-13 09:58:21,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:58:21,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:58:21,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash -172201770, now seen corresponding path program 1 times [2024-10-13 09:58:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:21,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171866303] [2024-10-13 09:58:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:21,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:21,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:21,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171866303] [2024-10-13 09:58:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171866303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:21,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:21,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14176732] [2024-10-13 09:58:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:21,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:21,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:21,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 148 [2024-10-13 09:58:21,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:21,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 148 [2024-10-13 09:58:21,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:21,673 INFO L124 PetriNetUnfolderBase]: 4/112 cut-off events. [2024-10-13 09:58:21,674 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:21,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 112 events. 4/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 3 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 18 conditions per place. [2024-10-13 09:58:21,675 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 11 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-10-13 09:58:21,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 102 transitions, 238 flow [2024-10-13 09:58:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2024-10-13 09:58:21,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8085585585585585 [2024-10-13 09:58:21,677 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 214 flow. Second operand 3 states and 359 transitions. [2024-10-13 09:58:21,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 102 transitions, 238 flow [2024-10-13 09:58:21,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 102 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:21,679 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 212 flow [2024-10-13 09:58:21,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2024-10-13 09:58:21,681 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -24 predicate places. [2024-10-13 09:58:21,682 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 212 flow [2024-10-13 09:58:21,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:21,682 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] [2024-10-13 09:58:21,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:58:21,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:58:21,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1655564726, now seen corresponding path program 1 times [2024-10-13 09:58:21,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:21,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063841994] [2024-10-13 09:58:21,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:21,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063841994] [2024-10-13 09:58:21,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063841994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:21,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:21,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091204969] [2024-10-13 09:58:21,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:21,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:21,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-10-13 09:58:21,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:21,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-10-13 09:58:21,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:21,847 INFO L124 PetriNetUnfolderBase]: 4/110 cut-off events. [2024-10-13 09:58:21,848 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:21,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 110 events. 4/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 3 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 65. Up to 14 conditions per place. [2024-10-13 09:58:21,849 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 10 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2024-10-13 09:58:21,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 230 flow [2024-10-13 09:58:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2024-10-13 09:58:21,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8198198198198198 [2024-10-13 09:58:21,851 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 212 flow. Second operand 3 states and 364 transitions. [2024-10-13 09:58:21,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 230 flow [2024-10-13 09:58:21,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 100 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:21,852 INFO L231 Difference]: Finished difference. Result has 104 places, 100 transitions, 206 flow [2024-10-13 09:58:21,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=104, PETRI_TRANSITIONS=100} [2024-10-13 09:58:21,853 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -26 predicate places. [2024-10-13 09:58:21,853 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 206 flow [2024-10-13 09:58:21,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:21,854 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] [2024-10-13 09:58:21,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:58:21,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-13 09:58:21,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -741924540, now seen corresponding path program 1 times [2024-10-13 09:58:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230231138] [2024-10-13 09:58:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230231138] [2024-10-13 09:58:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230231138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:21,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521161823] [2024-10-13 09:58:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:21,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:21,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:21,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-10-13 09:58:21,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 100 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:21,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-10-13 09:58:21,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:21,965 INFO L124 PetriNetUnfolderBase]: 4/108 cut-off events. [2024-10-13 09:58:21,965 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:21,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 108 events. 4/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 3 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 112. Up to 14 conditions per place. [2024-10-13 09:58:21,966 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 0 selfloop transitions, 0 changer transitions 98/98 dead transitions. [2024-10-13 09:58:21,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 98 transitions, 222 flow [2024-10-13 09:58:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-10-13 09:58:21,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8175675675675675 [2024-10-13 09:58:21,967 INFO L175 Difference]: Start difference. First operand has 104 places, 100 transitions, 206 flow. Second operand 3 states and 363 transitions. [2024-10-13 09:58:21,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 98 transitions, 222 flow [2024-10-13 09:58:21,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 98 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:21,969 INFO L231 Difference]: Finished difference. Result has 103 places, 0 transitions, 0 flow [2024-10-13 09:58:21,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=103, PETRI_TRANSITIONS=0} [2024-10-13 09:58:21,970 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -27 predicate places. [2024-10-13 09:58:21,971 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 0 transitions, 0 flow [2024-10-13 09:58:21,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:21,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 44 remaining) [2024-10-13 09:58:21,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2024-10-13 09:58:21,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2024-10-13 09:58:21,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2024-10-13 09:58:21,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2024-10-13 09:58:21,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2024-10-13 09:58:21,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2024-10-13 09:58:21,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2024-10-13 09:58:21,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2024-10-13 09:58:21,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2024-10-13 09:58:21,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2024-10-13 09:58:21,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2024-10-13 09:58:21,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2024-10-13 09:58:21,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2024-10-13 09:58:21,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2024-10-13 09:58:21,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2024-10-13 09:58:21,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2024-10-13 09:58:21,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2024-10-13 09:58:21,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2024-10-13 09:58:21,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2024-10-13 09:58:21,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2024-10-13 09:58:21,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2024-10-13 09:58:21,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2024-10-13 09:58:21,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2024-10-13 09:58:21,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2024-10-13 09:58:21,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2024-10-13 09:58:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 44 remaining) [2024-10-13 09:58:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 44 remaining) [2024-10-13 09:58:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2024-10-13 09:58:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2024-10-13 09:58:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2024-10-13 09:58:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2024-10-13 09:58:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2024-10-13 09:58:21,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2024-10-13 09:58:21,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2024-10-13 09:58:21,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2024-10-13 09:58:21,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2024-10-13 09:58:21,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2024-10-13 09:58:21,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2024-10-13 09:58:21,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2024-10-13 09:58:21,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2024-10-13 09:58:21,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2024-10-13 09:58:21,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2024-10-13 09:58:21,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2024-10-13 09:58:21,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:58:21,984 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:21,991 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:58:21,991 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:58:21,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:58:21 BasicIcfg [2024-10-13 09:58:21,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:58:22,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:58:22,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:58:22,001 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:58:22,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:20" (3/4) ... [2024-10-13 09:58:22,003 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:58:22,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:58:22,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:58:22,010 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 09:58:22,010 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:58:22,011 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:58:22,011 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:58:22,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:58:22,104 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:58:22,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:58:22,104 INFO L158 Benchmark]: Toolchain (without parser) took 3098.41ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 74.0MB in the beginning and 97.9MB in the end (delta: -23.9MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-10-13 09:58:22,105 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory was 91.1MB in the beginning and 91.0MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:58:22,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.60ms. Allocated memory is still 130.0MB. Free memory was 73.7MB in the beginning and 60.7MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 09:58:22,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.91ms. Allocated memory is still 130.0MB. Free memory was 60.7MB in the beginning and 58.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:58:22,106 INFO L158 Benchmark]: Boogie Preprocessor took 54.97ms. Allocated memory is still 130.0MB. Free memory was 58.5MB in the beginning and 102.2MB in the end (delta: -43.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-10-13 09:58:22,106 INFO L158 Benchmark]: RCFGBuilder took 928.61ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 102.1MB in the beginning and 85.7MB in the end (delta: 16.4MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2024-10-13 09:58:22,106 INFO L158 Benchmark]: TraceAbstraction took 1676.49ms. Allocated memory is still 180.4MB. Free memory was 84.7MB in the beginning and 103.2MB in the end (delta: -18.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:58:22,107 INFO L158 Benchmark]: Witness Printer took 103.09ms. Allocated memory is still 180.4MB. Free memory was 103.2MB in the beginning and 97.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 09:58:22,108 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.23ms. Allocated memory is still 130.0MB. Free memory was 91.1MB in the beginning and 91.0MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.60ms. Allocated memory is still 130.0MB. Free memory was 73.7MB in the beginning and 60.7MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.91ms. Allocated memory is still 130.0MB. Free memory was 60.7MB in the beginning and 58.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.97ms. Allocated memory is still 130.0MB. Free memory was 58.5MB in the beginning and 102.2MB in the end (delta: -43.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * RCFGBuilder took 928.61ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 102.1MB in the beginning and 85.7MB in the end (delta: 16.4MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1676.49ms. Allocated memory is still 180.4MB. Free memory was 84.7MB in the beginning and 103.2MB in the end (delta: -18.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 103.09ms. Allocated memory is still 180.4MB. Free memory was 103.2MB in the beginning and 97.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 174 locations, 44 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: 1.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 39 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=0, InterpolantAutomatonStates: 24, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 26 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 09:58:22,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE