./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/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:05:24,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:05:24,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:05:24,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:05:24,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:05:24,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:05:24,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:05:24,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:05:24,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:05:24,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:05:24,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:05:24,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:05:24,230 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:05:24,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:05:24,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:05:24,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:05:24,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:05:24,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:05:24,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:05:24,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:05:24,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:05:24,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:05:24,237 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:05:24,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:05:24,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:05:24,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:05:24,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:05:24,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:05:24,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:05:24,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:05:24,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:05:24,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:05:24,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:05:24,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:05:24,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:05:24,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:05:24,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:05:24,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:05:24,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:05:24,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:05:24,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:05:24,241 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff [2024-10-11 17:05:24,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:05:24,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:05:24,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:05:24,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:05:24,483 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:05:24,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2024-10-11 17:05:25,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:05:26,077 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:05:26,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2024-10-11 17:05:26,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/19745ccf7/ab1060b743f74d49905810c89d3dbfe8/FLAG34c350340 [2024-10-11 17:05:26,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/19745ccf7/ab1060b743f74d49905810c89d3dbfe8 [2024-10-11 17:05:26,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:05:26,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:05:26,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:05:26,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:05:26,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:05:26,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ac15db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26, skipping insertion in model container [2024-10-11 17:05:26,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:05:26,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:05:26,816 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:05:26,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:05:26,900 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:05:26,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26 WrapperNode [2024-10-11 17:05:26,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:05:26,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:05:26,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:05:26,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:05:26,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,942 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2024-10-11 17:05:26,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:05:26,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:05:26,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:05:26,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:05:26,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:05:26,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:05:26,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:05:26,979 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:05:26,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (1/1) ... [2024-10-11 17:05:26,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:05:27,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:05:27,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:05:27,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:05:27,069 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-11 17:05:27,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-11 17:05:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 17:05:27,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 17:05:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:05:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:05:27,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:05:27,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:05:27,072 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:05:27,177 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:05:27,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:05:27,321 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:05:27,321 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:05:27,334 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:05:27,334 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 17:05:27,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:27 BoogieIcfgContainer [2024-10-11 17:05:27,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:05:27,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:05:27,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:05:27,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:05:27,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:05:26" (1/3) ... [2024-10-11 17:05:27,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dbce04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:05:27, skipping insertion in model container [2024-10-11 17:05:27,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:26" (2/3) ... [2024-10-11 17:05:27,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dbce04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:05:27, skipping insertion in model container [2024-10-11 17:05:27,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:27" (3/3) ... [2024-10-11 17:05:27,342 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2024-10-11 17:05:27,355 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:05:27,356 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-10-11 17:05:27,356 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:05:27,399 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:05:27,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 111 transitions, 230 flow [2024-10-11 17:05:27,473 INFO L124 PetriNetUnfolderBase]: 6/124 cut-off events. [2024-10-11 17:05:27,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:05:27,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 170 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2024-10-11 17:05:27,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 111 transitions, 230 flow [2024-10-11 17:05:27,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 110 transitions, 227 flow [2024-10-11 17:05:27,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:05:27,496 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;@285cd46d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:05:27,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 17:05:27,500 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:05:27,500 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-10-11 17:05:27,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:05:27,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:27,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:27,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:05:27,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1524266874, now seen corresponding path program 1 times [2024-10-11 17:05:27,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:27,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494658463] [2024-10-11 17:05:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:27,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494658463] [2024-10-11 17:05:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494658463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:27,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669270370] [2024-10-11 17:05:27,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:27,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:27,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:27,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:27,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 111 [2024-10-11 17:05:27,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:27,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:27,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 111 [2024-10-11 17:05:27,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:27,888 INFO L124 PetriNetUnfolderBase]: 12/229 cut-off events. [2024-10-11 17:05:27,890 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:05:27,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 229 events. 12/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 770 event pairs, 11 based on Foata normal form. 18/205 useless extension candidates. Maximal degree in co-relation 209. Up to 31 conditions per place. [2024-10-11 17:05:27,894 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 9 selfloop transitions, 2 changer transitions 1/103 dead transitions. [2024-10-11 17:05:27,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 103 transitions, 235 flow [2024-10-11 17:05:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-10-11 17:05:27,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8948948948948949 [2024-10-11 17:05:27,910 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 227 flow. Second operand 3 states and 298 transitions. [2024-10-11 17:05:27,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 103 transitions, 235 flow [2024-10-11 17:05:27,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 103 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:05:27,916 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 214 flow [2024-10-11 17:05:27,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=107, 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=109, PETRI_TRANSITIONS=102} [2024-10-11 17:05:27,921 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2024-10-11 17:05:27,922 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 214 flow [2024-10-11 17:05:27,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:27,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:27,923 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] [2024-10-11 17:05:27,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:05:27,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:05:27,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash 850971737, now seen corresponding path program 1 times [2024-10-11 17:05:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:27,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463250342] [2024-10-11 17:05:27,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:27,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:28,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:28,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463250342] [2024-10-11 17:05:28,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463250342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:28,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:28,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325448197] [2024-10-11 17:05:28,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:28,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:28,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:28,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:28,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:28,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2024-10-11 17:05:28,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:28,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2024-10-11 17:05:28,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:28,061 INFO L124 PetriNetUnfolderBase]: 6/165 cut-off events. [2024-10-11 17:05:28,062 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:05:28,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 165 events. 6/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 433 event pairs, 5 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 174. Up to 23 conditions per place. [2024-10-11 17:05:28,063 INFO L140 encePairwiseOnDemand]: 108/111 looper letters, 10 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-10-11 17:05:28,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 236 flow [2024-10-11 17:05:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-10-11 17:05:28,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8768768768768769 [2024-10-11 17:05:28,066 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 214 flow. Second operand 3 states and 292 transitions. [2024-10-11 17:05:28,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 101 transitions, 236 flow [2024-10-11 17:05:28,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:05:28,069 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 212 flow [2024-10-11 17:05:28,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2024-10-11 17:05:28,070 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2024-10-11 17:05:28,070 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 212 flow [2024-10-11 17:05:28,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:28,071 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] [2024-10-11 17:05:28,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:05:28,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:05:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1456105701, now seen corresponding path program 1 times [2024-10-11 17:05:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549099025] [2024-10-11 17:05:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:28,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:28,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549099025] [2024-10-11 17:05:28,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549099025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:28,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:28,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:28,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130598590] [2024-10-11 17:05:28,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:28,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:28,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:28,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:28,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:28,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2024-10-11 17:05:28,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:28,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2024-10-11 17:05:28,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:28,207 INFO L124 PetriNetUnfolderBase]: 11/217 cut-off events. [2024-10-11 17:05:28,207 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:05:28,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 217 events. 11/217 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 780 event pairs, 10 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 230. Up to 32 conditions per place. [2024-10-11 17:05:28,209 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 10 selfloop transitions, 1 changer transitions 0/97 dead transitions. [2024-10-11 17:05:28,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 226 flow [2024-10-11 17:05:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-10-11 17:05:28,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8648648648648649 [2024-10-11 17:05:28,212 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 212 flow. Second operand 3 states and 288 transitions. [2024-10-11 17:05:28,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 226 flow [2024-10-11 17:05:28,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 97 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:05:28,214 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 202 flow [2024-10-11 17:05:28,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2024-10-11 17:05:28,215 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -8 predicate places. [2024-10-11 17:05:28,215 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 202 flow [2024-10-11 17:05:28,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:28,216 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] [2024-10-11 17:05:28,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:05:28,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:05:28,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:28,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1667615661, now seen corresponding path program 1 times [2024-10-11 17:05:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:28,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895592355] [2024-10-11 17:05:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895592355] [2024-10-11 17:05:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895592355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:28,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:28,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862930595] [2024-10-11 17:05:28,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:28,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:28,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2024-10-11 17:05:28,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:28,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2024-10-11 17:05:28,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:28,335 INFO L124 PetriNetUnfolderBase]: 8/175 cut-off events. [2024-10-11 17:05:28,336 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:05:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 175 events. 8/175 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 487 event pairs, 2 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 180. Up to 19 conditions per place. [2024-10-11 17:05:28,339 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 9 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2024-10-11 17:05:28,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 100 transitions, 237 flow [2024-10-11 17:05:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-10-11 17:05:28,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-10-11 17:05:28,341 INFO L175 Difference]: Start difference. First operand has 103 places, 97 transitions, 202 flow. Second operand 3 states and 303 transitions. [2024-10-11 17:05:28,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 100 transitions, 237 flow [2024-10-11 17:05:28,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:05:28,344 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 229 flow [2024-10-11 17:05:28,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2024-10-11 17:05:28,345 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2024-10-11 17:05:28,345 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 229 flow [2024-10-11 17:05:28,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:28,346 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] [2024-10-11 17:05:28,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:05:28,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:05:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash -385399741, now seen corresponding path program 1 times [2024-10-11 17:05:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:28,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426019758] [2024-10-11 17:05:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426019758] [2024-10-11 17:05:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426019758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:28,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:05:28,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618215267] [2024-10-11 17:05:28,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:28,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:05:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:05:28,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:05:28,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2024-10-11 17:05:28,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:28,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2024-10-11 17:05:28,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:28,483 INFO L124 PetriNetUnfolderBase]: 7/210 cut-off events. [2024-10-11 17:05:28,483 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2024-10-11 17:05:28,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 210 events. 7/210 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 675 event pairs, 2 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 247. Up to 23 conditions per place. [2024-10-11 17:05:28,486 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 11 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-10-11 17:05:28,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 269 flow [2024-10-11 17:05:28,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:05:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:05:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2024-10-11 17:05:28,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2024-10-11 17:05:28,488 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 229 flow. Second operand 3 states and 302 transitions. [2024-10-11 17:05:28,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 269 flow [2024-10-11 17:05:28,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:05:28,490 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 253 flow [2024-10-11 17:05:28,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-10-11 17:05:28,494 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2024-10-11 17:05:28,494 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 253 flow [2024-10-11 17:05:28,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:28,495 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] [2024-10-11 17:05:28,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:05:28,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:05:28,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1187427640, now seen corresponding path program 1 times [2024-10-11 17:05:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503912443] [2024-10-11 17:05:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:28,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:05:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:05:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:05:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503912443] [2024-10-11 17:05:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503912443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:05:28,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:05:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:05:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206375176] [2024-10-11 17:05:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:05:28,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:05:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:05:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:05:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:05:28,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2024-10-11 17:05:28,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:05:28,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2024-10-11 17:05:28,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:05:28,677 INFO L124 PetriNetUnfolderBase]: 4/197 cut-off events. [2024-10-11 17:05:28,677 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-11 17:05:28,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 197 events. 4/197 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 577 event pairs, 1 based on Foata normal form. 1/186 useless extension candidates. Maximal degree in co-relation 236. Up to 16 conditions per place. [2024-10-11 17:05:28,678 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 14 selfloop transitions, 0 changer transitions 4/105 dead transitions. [2024-10-11 17:05:28,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 295 flow [2024-10-11 17:05:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:05:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:05:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2024-10-11 17:05:28,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8450450450450451 [2024-10-11 17:05:28,680 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 253 flow. Second operand 5 states and 469 transitions. [2024-10-11 17:05:28,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 295 flow [2024-10-11 17:05:28,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:05:28,696 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 249 flow [2024-10-11 17:05:28,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2024-10-11 17:05:28,697 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2024-10-11 17:05:28,697 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 101 transitions, 249 flow [2024-10-11 17:05:28,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:05:28,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:05:28,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:28,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:05:28,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:05:28,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:05:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash -103993823, now seen corresponding path program 1 times [2024-10-11 17:05:28,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:05:28,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841294815] [2024-10-11 17:05:28,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:05:28,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:05:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:05:28,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:05:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:05:28,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:05:28,804 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:05:28,805 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-10-11 17:05:28,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-11 17:05:28,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-11 17:05:28,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-11 17:05:28,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-11 17:05:28,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-11 17:05:28,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-10-11 17:05:28,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-11 17:05:28,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-11 17:05:28,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-11 17:05:28,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2024-10-11 17:05:28,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2024-10-11 17:05:28,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-11 17:05:28,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-11 17:05:28,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-11 17:05:28,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:05:28,809 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:05:28,856 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:05:28,856 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:05:28,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:05:28 BasicIcfg [2024-10-11 17:05:28,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:05:28,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:05:28,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:05:28,869 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:05:28,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:27" (3/4) ... [2024-10-11 17:05:28,870 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:05:28,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:05:28,872 INFO L158 Benchmark]: Toolchain (without parser) took 2432.44ms. Allocated memory was 174.1MB in the beginning and 239.1MB in the end (delta: 65.0MB). Free memory was 115.9MB in the beginning and 189.5MB in the end (delta: -73.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:05:28,874 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:05:28,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.46ms. Allocated memory is still 174.1MB. Free memory was 115.2MB in the beginning and 94.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:05:28,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.82ms. Allocated memory is still 174.1MB. Free memory was 94.3MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:05:28,875 INFO L158 Benchmark]: Boogie Preprocessor took 34.54ms. Allocated memory is still 174.1MB. Free memory was 92.1MB in the beginning and 90.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:05:28,875 INFO L158 Benchmark]: RCFGBuilder took 356.26ms. Allocated memory is still 174.1MB. Free memory was 90.8MB in the beginning and 76.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:05:28,875 INFO L158 Benchmark]: TraceAbstraction took 1531.44ms. Allocated memory was 174.1MB in the beginning and 239.1MB in the end (delta: 65.0MB). Free memory was 75.4MB in the beginning and 190.6MB in the end (delta: -115.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:05:28,875 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 239.1MB. Free memory was 190.6MB in the beginning and 189.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:05:28,877 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.14ms. Allocated memory is still 174.1MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.46ms. Allocated memory is still 174.1MB. Free memory was 115.2MB in the beginning and 94.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.82ms. Allocated memory is still 174.1MB. Free memory was 94.3MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.54ms. Allocated memory is still 174.1MB. Free memory was 92.1MB in the beginning and 90.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 356.26ms. Allocated memory is still 174.1MB. Free memory was 90.8MB in the beginning and 76.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1531.44ms. Allocated memory was 174.1MB in the beginning and 239.1MB in the end (delta: 65.0MB). Free memory was 75.4MB in the beginning and 190.6MB in the end (delta: -115.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 239.1MB. Free memory was 190.6MB in the beginning and 189.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L701] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L702] 0 int i; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L703] 0 x = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L704] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] CALL 0 assume_abort_if_not(n >= 20 && n < 40) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=39, x=0] [L705] RET 0 assume_abort_if_not(n >= 20 && n < 40) [L706] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, t1=-1, x=0] [L707] 0 i = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L707] 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L707] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L708] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(arg)={0:0}, \old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, t2=0, x=0] [L696] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, n=39, x=0] [L693] 1 x < n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=39, x=0] [L697] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, n=39, t=0, x=0] [L698] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, n=39, t=0, x=1] [L693] 1 x < n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=39, t=0, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [698] and C: x < n [693] - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 142 locations, 15 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.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 27 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=5, InterpolantAutomatonStates: 20, 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, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-11 17:05:28,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE