./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-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 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/pthread-divine/condvar.i -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 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:02:34,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:02:35,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:02:35,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:02:35,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:02:35,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:02:35,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:02:35,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:02:35,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:02:35,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:02:35,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:02:35,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:02:35,038 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:02:35,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:02:35,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:02:35,040 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:02:35,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:02:35,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:02:35,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:02:35,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:02:35,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:02:35,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:02:35,043 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:02:35,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:02:35,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:02:35,044 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:02:35,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:02:35,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:02:35,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:02:35,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:02:35,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:02:35,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:02:35,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:02:35,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:02:35,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:02:35,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:02:35,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:02:35,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:02:35,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:02:35,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:02:35,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:02:35,048 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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2024-10-14 17:02:35,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:02:35,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:02:35,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:02:35,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:02:35,263 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:02:35,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/condvar.i [2024-10-14 17:02:36,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:02:36,658 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:02:36,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/condvar.i [2024-10-14 17:02:36,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b9375dd/91f5374a4af2440abfff6c5d7f4d6e37/FLAG989cc650d [2024-10-14 17:02:36,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b9375dd/91f5374a4af2440abfff6c5d7f4d6e37 [2024-10-14 17:02:36,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:02:36,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:02:36,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:02:36,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:02:36,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:02:36,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:02:36" (1/1) ... [2024-10-14 17:02:36,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7baace64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:36, skipping insertion in model container [2024-10-14 17:02:36,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:02:36" (1/1) ... [2024-10-14 17:02:36,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:02:37,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:02:37,063 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:02:37,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:02:37,135 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:02:37,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37 WrapperNode [2024-10-14 17:02:37,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:02:37,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:02:37,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:02:37,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:02:37,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,174 INFO L138 Inliner]: procedures = 168, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2024-10-14 17:02:37,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:02:37,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:02:37,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:02:37,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:02:37,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:02:37,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:02:37,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:02:37,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:02:37,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (1/1) ... [2024-10-14 17:02:37,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:02:37,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:02:37,239 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-14 17:02:37,242 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-14 17:02:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 17:02:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:02:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:02:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-14 17:02:37,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-14 17:02:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 17:02:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:02:37,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:02:37,282 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:02:37,378 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:02:37,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:02:37,522 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:02:37,523 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:02:37,540 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:02:37,541 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:02:37,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:02:37 BoogieIcfgContainer [2024-10-14 17:02:37,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:02:37,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:02:37,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:02:37,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:02:37,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:02:36" (1/3) ... [2024-10-14 17:02:37,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5250bcbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:02:37, skipping insertion in model container [2024-10-14 17:02:37,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:02:37" (2/3) ... [2024-10-14 17:02:37,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5250bcbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:02:37, skipping insertion in model container [2024-10-14 17:02:37,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:02:37" (3/3) ... [2024-10-14 17:02:37,551 INFO L112 eAbstractionObserver]: Analyzing ICFG condvar.i [2024-10-14 17:02:37,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:02:37,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 17:02:37,562 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:02:37,598 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-14 17:02:37,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 92 transitions, 191 flow [2024-10-14 17:02:37,655 INFO L124 PetriNetUnfolderBase]: 6/91 cut-off events. [2024-10-14 17:02:37,655 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:02:37,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 6/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-10-14 17:02:37,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 92 transitions, 191 flow [2024-10-14 17:02:37,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 87 transitions, 177 flow [2024-10-14 17:02:37,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:02:37,674 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;@c81207d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:02:37,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 17:02:37,692 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:02:37,692 INFO L124 PetriNetUnfolderBase]: 1/52 cut-off events. [2024-10-14 17:02:37,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:02:37,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:37,693 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-14 17:02:37,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:37,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -452954509, now seen corresponding path program 1 times [2024-10-14 17:02:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:37,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585745639] [2024-10-14 17:02:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:37,923 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-14 17:02:37,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585745639] [2024-10-14 17:02:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585745639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:02:37,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:02:37,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:02:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812608671] [2024-10-14 17:02:37,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:02:37,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:02:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:37,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:02:37,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:02:37,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 92 [2024-10-14 17:02:37,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-14 17:02:37,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:37,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 92 [2024-10-14 17:02:37,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:38,035 INFO L124 PetriNetUnfolderBase]: 9/125 cut-off events. [2024-10-14 17:02:38,037 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:02:38,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 125 events. 9/125 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 295 event pairs, 1 based on Foata normal form. 12/121 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2024-10-14 17:02:38,040 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 12 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2024-10-14 17:02:38,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 209 flow [2024-10-14 17:02:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:02:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:02:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2024-10-14 17:02:38,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9347826086956522 [2024-10-14 17:02:38,080 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 177 flow. Second operand 3 states and 258 transitions. [2024-10-14 17:02:38,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 209 flow [2024-10-14 17:02:38,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:02:38,088 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 192 flow [2024-10-14 17:02:38,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2024-10-14 17:02:38,093 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 2 predicate places. [2024-10-14 17:02:38,094 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 192 flow [2024-10-14 17:02:38,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-14 17:02:38,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:38,095 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] [2024-10-14 17:02:38,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:02:38,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:38,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1864621227, now seen corresponding path program 1 times [2024-10-14 17:02:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:38,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120908035] [2024-10-14 17:02:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:38,204 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-14 17:02:38,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:38,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120908035] [2024-10-14 17:02:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120908035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:02:38,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:02:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:02:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751206492] [2024-10-14 17:02:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:02:38,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:02:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:02:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:02:38,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 92 [2024-10-14 17:02:38,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-14 17:02:38,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:38,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 92 [2024-10-14 17:02:38,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:38,294 INFO L124 PetriNetUnfolderBase]: 33/282 cut-off events. [2024-10-14 17:02:38,295 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-14 17:02:38,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 282 events. 33/282 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1327 event pairs, 6 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 346. Up to 39 conditions per place. [2024-10-14 17:02:38,298 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 14 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2024-10-14 17:02:38,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 92 transitions, 242 flow [2024-10-14 17:02:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:02:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:02:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2024-10-14 17:02:38,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-10-14 17:02:38,301 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 192 flow. Second operand 3 states and 244 transitions. [2024-10-14 17:02:38,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 92 transitions, 242 flow [2024-10-14 17:02:38,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 92 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:02:38,304 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 216 flow [2024-10-14 17:02:38,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-10-14 17:02:38,305 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 4 predicate places. [2024-10-14 17:02:38,305 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 216 flow [2024-10-14 17:02:38,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-14 17:02:38,305 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:38,305 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] [2024-10-14 17:02:38,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:02:38,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:38,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 819728537, now seen corresponding path program 1 times [2024-10-14 17:02:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:38,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905061805] [2024-10-14 17:02:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:38,359 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-14 17:02:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905061805] [2024-10-14 17:02:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905061805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:02:38,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:02:38,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:02:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755851172] [2024-10-14 17:02:38,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:02:38,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:02:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:02:38,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:02:38,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 92 [2024-10-14 17:02:38,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-14 17:02:38,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:38,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 92 [2024-10-14 17:02:38,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:38,414 INFO L124 PetriNetUnfolderBase]: 23/254 cut-off events. [2024-10-14 17:02:38,415 INFO L125 PetriNetUnfolderBase]: For 27/29 co-relation queries the response was YES. [2024-10-14 17:02:38,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 254 events. 23/254 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1134 event pairs, 4 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 337. Up to 27 conditions per place. [2024-10-14 17:02:38,417 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 9 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2024-10-14 17:02:38,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 252 flow [2024-10-14 17:02:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:02:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:02:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2024-10-14 17:02:38,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.894927536231884 [2024-10-14 17:02:38,420 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 216 flow. Second operand 3 states and 247 transitions. [2024-10-14 17:02:38,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 252 flow [2024-10-14 17:02:38,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 91 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:02:38,422 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 236 flow [2024-10-14 17:02:38,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2024-10-14 17:02:38,425 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 6 predicate places. [2024-10-14 17:02:38,426 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 236 flow [2024-10-14 17:02:38,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-14 17:02:38,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:38,426 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] [2024-10-14 17:02:38,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:02:38,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:38,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2045814322, now seen corresponding path program 1 times [2024-10-14 17:02:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:38,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089001082] [2024-10-14 17:02:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:38,492 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-14 17:02:38,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:38,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089001082] [2024-10-14 17:02:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089001082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:02:38,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:02:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:02:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383702448] [2024-10-14 17:02:38,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:02:38,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:02:38,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:38,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:02:38,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:02:38,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 92 [2024-10-14 17:02:38,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-14 17:02:38,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:38,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 92 [2024-10-14 17:02:38,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:38,569 INFO L124 PetriNetUnfolderBase]: 58/406 cut-off events. [2024-10-14 17:02:38,569 INFO L125 PetriNetUnfolderBase]: For 47/54 co-relation queries the response was YES. [2024-10-14 17:02:38,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 406 events. 58/406 cut-off events. For 47/54 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2337 event pairs, 6 based on Foata normal form. 5/365 useless extension candidates. Maximal degree in co-relation 598. Up to 76 conditions per place. [2024-10-14 17:02:38,573 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 13 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-10-14 17:02:38,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 276 flow [2024-10-14 17:02:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:02:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:02:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2024-10-14 17:02:38,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-10-14 17:02:38,575 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 236 flow. Second operand 3 states and 244 transitions. [2024-10-14 17:02:38,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 276 flow [2024-10-14 17:02:38,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 95 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:02:38,580 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 240 flow [2024-10-14 17:02:38,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2024-10-14 17:02:38,581 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 7 predicate places. [2024-10-14 17:02:38,582 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 240 flow [2024-10-14 17:02:38,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-14 17:02:38,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:38,583 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:02:38,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:02:38,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:38,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash 542405636, now seen corresponding path program 1 times [2024-10-14 17:02:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:38,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789902120] [2024-10-14 17:02:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:38,700 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-14 17:02:38,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:38,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789902120] [2024-10-14 17:02:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789902120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:02:38,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:02:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:02:38,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135737347] [2024-10-14 17:02:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:02:38,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:02:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:02:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:02:38,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2024-10-14 17:02:38,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-14 17:02:38,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:38,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2024-10-14 17:02:38,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:38,730 INFO L124 PetriNetUnfolderBase]: 8/136 cut-off events. [2024-10-14 17:02:38,731 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:02:38,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 136 events. 8/136 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 302 event pairs, 0 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 145. Up to 14 conditions per place. [2024-10-14 17:02:38,731 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 9 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2024-10-14 17:02:38,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 88 transitions, 240 flow [2024-10-14 17:02:38,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:02:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:02:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2024-10-14 17:02:38,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021739130434783 [2024-10-14 17:02:38,733 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 240 flow. Second operand 3 states and 249 transitions. [2024-10-14 17:02:38,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 88 transitions, 240 flow [2024-10-14 17:02:38,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 230 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-14 17:02:38,736 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 210 flow [2024-10-14 17:02:38,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2024-10-14 17:02:38,737 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 5 predicate places. [2024-10-14 17:02:38,737 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 210 flow [2024-10-14 17:02:38,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-14 17:02:38,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:38,738 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] [2024-10-14 17:02:38,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:02:38,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:38,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:38,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2145560105, now seen corresponding path program 1 times [2024-10-14 17:02:38,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:38,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757870915] [2024-10-14 17:02:38,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:38,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:38,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757870915] [2024-10-14 17:02:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757870915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:02:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137767125] [2024-10-14 17:02:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:38,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:38,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:02:38,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:02:38,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:02:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:38,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:02:38,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:02:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:02:38,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:02:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137767125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:02:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:02:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-14 17:02:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785654758] [2024-10-14 17:02:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:02:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:02:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:38,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:02:38,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:02:38,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 92 [2024-10-14 17:02:38,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-14 17:02:38,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:38,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 92 [2024-10-14 17:02:38,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:38,983 INFO L124 PetriNetUnfolderBase]: 50/242 cut-off events. [2024-10-14 17:02:38,983 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-14 17:02:38,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 242 events. 50/242 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 910 event pairs, 15 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 357. Up to 70 conditions per place. [2024-10-14 17:02:38,984 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 14 selfloop transitions, 5 changer transitions 3/93 dead transitions. [2024-10-14 17:02:38,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 93 transitions, 274 flow [2024-10-14 17:02:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:02:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:02:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2024-10-14 17:02:38,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8768115942028986 [2024-10-14 17:02:38,986 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 210 flow. Second operand 3 states and 242 transitions. [2024-10-14 17:02:38,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 93 transitions, 274 flow [2024-10-14 17:02:38,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 93 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:02:38,989 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 242 flow [2024-10-14 17:02:38,990 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-10-14 17:02:38,991 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 7 predicate places. [2024-10-14 17:02:38,991 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 242 flow [2024-10-14 17:02:38,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-14 17:02:38,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:38,992 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-14 17:02:39,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:02:39,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 17:02:39,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:39,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1412335387, now seen corresponding path program 1 times [2024-10-14 17:02:39,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:39,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072194002] [2024-10-14 17:02:39,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072194002] [2024-10-14 17:02:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072194002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:02:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605145899] [2024-10-14 17:02:39,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:39,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:39,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:02:39,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:02:39,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:02:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:39,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:02:39,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:02:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:39,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:02:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:39,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605145899] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:02:39,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:02:39,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-14 17:02:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644783598] [2024-10-14 17:02:39,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:02:39,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:02:39,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:02:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:02:39,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2024-10-14 17:02:39,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 242 flow. Second operand has 10 states, 10 states have (on average 75.0) internal successors, (750), 10 states have internal predecessors, (750), 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-14 17:02:39,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:39,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2024-10-14 17:02:39,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:39,568 INFO L124 PetriNetUnfolderBase]: 72/339 cut-off events. [2024-10-14 17:02:39,569 INFO L125 PetriNetUnfolderBase]: For 47/50 co-relation queries the response was YES. [2024-10-14 17:02:39,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 339 events. 72/339 cut-off events. For 47/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1189 event pairs, 9 based on Foata normal form. 8/333 useless extension candidates. Maximal degree in co-relation 580. Up to 47 conditions per place. [2024-10-14 17:02:39,571 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 34 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2024-10-14 17:02:39,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 116 transitions, 388 flow [2024-10-14 17:02:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:02:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 17:02:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 702 transitions. [2024-10-14 17:02:39,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2024-10-14 17:02:39,573 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 242 flow. Second operand 9 states and 702 transitions. [2024-10-14 17:02:39,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 116 transitions, 388 flow [2024-10-14 17:02:39,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 116 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:02:39,576 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 282 flow [2024-10-14 17:02:39,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=282, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2024-10-14 17:02:39,577 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 16 predicate places. [2024-10-14 17:02:39,578 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 282 flow [2024-10-14 17:02:39,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 10 states have internal predecessors, (750), 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-14 17:02:39,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:39,579 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:02:39,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:02:39,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 17:02:39,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:39,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:39,784 INFO L85 PathProgramCache]: Analyzing trace with hash -403331913, now seen corresponding path program 2 times [2024-10-14 17:02:39,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837233910] [2024-10-14 17:02:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:39,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:39,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:39,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837233910] [2024-10-14 17:02:39,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837233910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:02:39,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138148904] [2024-10-14 17:02:39,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:02:39,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:39,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:02:39,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:02:39,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:02:39,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:02:39,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:02:39,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:02:39,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:02:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:40,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:02:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:40,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138148904] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:02:40,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:02:40,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-14 17:02:40,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282947264] [2024-10-14 17:02:40,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:02:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 17:02:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:40,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 17:02:40,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:02:40,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2024-10-14 17:02:40,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 282 flow. Second operand has 18 states, 18 states have (on average 75.05555555555556) internal successors, (1351), 18 states have internal predecessors, (1351), 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-14 17:02:40,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:40,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2024-10-14 17:02:40,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:40,403 INFO L124 PetriNetUnfolderBase]: 109/502 cut-off events. [2024-10-14 17:02:40,403 INFO L125 PetriNetUnfolderBase]: For 144/147 co-relation queries the response was YES. [2024-10-14 17:02:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 502 events. 109/502 cut-off events. For 144/147 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1817 event pairs, 12 based on Foata normal form. 16/505 useless extension candidates. Maximal degree in co-relation 1046. Up to 47 conditions per place. [2024-10-14 17:02:40,405 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 74 selfloop transitions, 21 changer transitions 0/168 dead transitions. [2024-10-14 17:02:40,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 168 transitions, 682 flow [2024-10-14 17:02:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 17:02:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-14 17:02:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1632 transitions. [2024-10-14 17:02:40,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84472049689441 [2024-10-14 17:02:40,408 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 282 flow. Second operand 21 states and 1632 transitions. [2024-10-14 17:02:40,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 168 transitions, 682 flow [2024-10-14 17:02:40,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 168 transitions, 668 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-14 17:02:40,411 INFO L231 Difference]: Finished difference. Result has 125 places, 106 transitions, 406 flow [2024-10-14 17:02:40,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=406, PETRI_PLACES=125, PETRI_TRANSITIONS=106} [2024-10-14 17:02:40,412 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 40 predicate places. [2024-10-14 17:02:40,412 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 106 transitions, 406 flow [2024-10-14 17:02:40,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 75.05555555555556) internal successors, (1351), 18 states have internal predecessors, (1351), 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-14 17:02:40,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:40,413 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:02:40,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 17:02:40,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:40,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:40,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash -148224513, now seen corresponding path program 3 times [2024-10-14 17:02:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280613707] [2024-10-14 17:02:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280613707] [2024-10-14 17:02:40,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280613707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:02:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215390642] [2024-10-14 17:02:40,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:02:40,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:02:40,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:02:40,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 17:02:40,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-14 17:02:40,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:02:40,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 17:02:40,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:02:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:41,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:02:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:41,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215390642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:02:41,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:02:41,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-10-14 17:02:41,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149174089] [2024-10-14 17:02:41,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:02:41,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 17:02:41,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 17:02:41,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 17:02:41,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2024-10-14 17:02:41,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 106 transitions, 406 flow. Second operand has 34 states, 34 states have (on average 75.02941176470588) internal successors, (2551), 34 states have internal predecessors, (2551), 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-14 17:02:41,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:41,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2024-10-14 17:02:41,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:41,989 INFO L124 PetriNetUnfolderBase]: 205/854 cut-off events. [2024-10-14 17:02:41,989 INFO L125 PetriNetUnfolderBase]: For 1078/1081 co-relation queries the response was YES. [2024-10-14 17:02:41,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 854 events. 205/854 cut-off events. For 1078/1081 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3116 event pairs, 12 based on Foata normal form. 32/873 useless extension candidates. Maximal degree in co-relation 2190. Up to 108 conditions per place. [2024-10-14 17:02:41,994 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 154 selfloop transitions, 45 changer transitions 0/272 dead transitions. [2024-10-14 17:02:41,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 272 transitions, 1350 flow [2024-10-14 17:02:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-14 17:02:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-10-14 17:02:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3492 transitions. [2024-10-14 17:02:42,000 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8434782608695652 [2024-10-14 17:02:42,000 INFO L175 Difference]: Start difference. First operand has 125 places, 106 transitions, 406 flow. Second operand 45 states and 3492 transitions. [2024-10-14 17:02:42,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 272 transitions, 1350 flow [2024-10-14 17:02:42,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 272 transitions, 1310 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-10-14 17:02:42,007 INFO L231 Difference]: Finished difference. Result has 172 places, 131 transitions, 684 flow [2024-10-14 17:02:42,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=684, PETRI_PLACES=172, PETRI_TRANSITIONS=131} [2024-10-14 17:02:42,008 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 87 predicate places. [2024-10-14 17:02:42,009 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 131 transitions, 684 flow [2024-10-14 17:02:42,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 75.02941176470588) internal successors, (2551), 34 states have internal predecessors, (2551), 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-14 17:02:42,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:42,010 INFO L204 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:02:42,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 17:02:42,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:42,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:42,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1281309317, now seen corresponding path program 4 times [2024-10-14 17:02:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491008151] [2024-10-14 17:02:42,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:42,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491008151] [2024-10-14 17:02:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491008151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:02:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001403288] [2024-10-14 17:02:42,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 17:02:42,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:42,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:02:42,850 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:02:42,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 17:02:42,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 17:02:42,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:02:42,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 17:02:42,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:02:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:43,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:02:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001403288] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:02:43,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:02:43,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2024-10-14 17:02:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835384975] [2024-10-14 17:02:43,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:02:43,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-14 17:02:43,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:43,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-14 17:02:43,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2024-10-14 17:02:43,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2024-10-14 17:02:43,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 131 transitions, 684 flow. Second operand has 66 states, 66 states have (on average 75.01515151515152) internal successors, (4951), 66 states have internal predecessors, (4951), 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-14 17:02:43,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:43,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2024-10-14 17:02:43,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:45,946 INFO L124 PetriNetUnfolderBase]: 520/1683 cut-off events. [2024-10-14 17:02:45,946 INFO L125 PetriNetUnfolderBase]: For 8807/8810 co-relation queries the response was YES. [2024-10-14 17:02:45,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5091 conditions, 1683 events. 520/1683 cut-off events. For 8807/8810 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5879 event pairs, 9 based on Foata normal form. 64/1733 useless extension candidates. Maximal degree in co-relation 5022. Up to 255 conditions per place. [2024-10-14 17:02:45,954 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 314 selfloop transitions, 93 changer transitions 0/480 dead transitions. [2024-10-14 17:02:45,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 480 transitions, 2832 flow [2024-10-14 17:02:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-10-14 17:02:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2024-10-14 17:02:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 7212 transitions. [2024-10-14 17:02:45,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8429172510518934 [2024-10-14 17:02:45,961 INFO L175 Difference]: Start difference. First operand has 172 places, 131 transitions, 684 flow. Second operand 93 states and 7212 transitions. [2024-10-14 17:02:45,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 480 transitions, 2832 flow [2024-10-14 17:02:45,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 480 transitions, 2744 flow, removed 26 selfloop flow, removed 18 redundant places. [2024-10-14 17:02:45,974 INFO L231 Difference]: Finished difference. Result has 263 places, 180 transitions, 1318 flow [2024-10-14 17:02:45,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=1318, PETRI_PLACES=263, PETRI_TRANSITIONS=180} [2024-10-14 17:02:45,975 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 178 predicate places. [2024-10-14 17:02:45,975 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 180 transitions, 1318 flow [2024-10-14 17:02:45,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 75.01515151515152) internal successors, (4951), 66 states have internal predecessors, (4951), 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-14 17:02:45,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:45,977 INFO L204 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:02:45,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 17:02:46,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 17:02:46,181 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1045999317, now seen corresponding path program 5 times [2024-10-14 17:02:46,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276657336] [2024-10-14 17:02:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:02:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:47,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:02:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276657336] [2024-10-14 17:02:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276657336] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:02:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144224677] [2024-10-14 17:02:47,883 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 17:02:47,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:47,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:02:47,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:02:47,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 17:02:47,989 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-10-14 17:02:47,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:02:47,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-14 17:02:47,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:02:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:48,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:02:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:02:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144224677] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:02:49,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:02:49,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 89 [2024-10-14 17:02:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608478951] [2024-10-14 17:02:49,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:02:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2024-10-14 17:02:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:02:49,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2024-10-14 17:02:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2024-10-14 17:02:49,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2024-10-14 17:02:49,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 180 transitions, 1318 flow. Second operand has 89 states, 89 states have (on average 75.03370786516854) internal successors, (6678), 89 states have internal predecessors, (6678), 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-14 17:02:49,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:02:49,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2024-10-14 17:02:49,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:02:53,257 INFO L124 PetriNetUnfolderBase]: 541/2086 cut-off events. [2024-10-14 17:02:53,257 INFO L125 PetriNetUnfolderBase]: For 28498/28501 co-relation queries the response was YES. [2024-10-14 17:02:53,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7276 conditions, 2086 events. 541/2086 cut-off events. For 28498/28501 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 7601 event pairs, 12 based on Foata normal form. 48/2121 useless extension candidates. Maximal degree in co-relation 7190. Up to 328 conditions per place. [2024-10-14 17:02:53,272 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 434 selfloop transitions, 129 changer transitions 0/636 dead transitions. [2024-10-14 17:02:53,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 636 transitions, 4186 flow [2024-10-14 17:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-10-14 17:02:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2024-10-14 17:02:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 9992 transitions. [2024-10-14 17:02:53,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8419278732726659 [2024-10-14 17:02:53,280 INFO L175 Difference]: Start difference. First operand has 263 places, 180 transitions, 1318 flow. Second operand 129 states and 9992 transitions. [2024-10-14 17:02:53,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 636 transitions, 4186 flow [2024-10-14 17:02:53,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 636 transitions, 4042 flow, removed 30 selfloop flow, removed 42 redundant places. [2024-10-14 17:02:53,311 INFO L231 Difference]: Finished difference. Result has 362 places, 217 transitions, 1916 flow [2024-10-14 17:02:53,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=1916, PETRI_PLACES=362, PETRI_TRANSITIONS=217} [2024-10-14 17:02:53,312 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 277 predicate places. [2024-10-14 17:02:53,342 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 217 transitions, 1916 flow [2024-10-14 17:02:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 75.03370786516854) internal successors, (6678), 89 states have internal predecessors, (6678), 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-14 17:02:53,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:02:53,345 INFO L204 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:02:53,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 17:02:53,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:02:53,546 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 17:02:53,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:02:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash 817673523, now seen corresponding path program 6 times [2024-10-14 17:02:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:02:53,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592114731] [2024-10-14 17:02:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:02:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:02:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:02:53,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:02:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:02:53,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:02:53,697 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:02:53,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-10-14 17:02:53,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-10-14 17:02:53,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-10-14 17:02:53,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 17:02:53,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-10-14 17:02:53,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-10-14 17:02:53,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-10-14 17:02:53,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:02:53,701 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-10-14 17:02:53,829 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:02:53,829 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:02:53,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:02:53 BasicIcfg [2024-10-14 17:02:53,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:02:53,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:02:53,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:02:53,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:02:53,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:02:37" (3/4) ... [2024-10-14 17:02:53,837 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 17:02:53,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:02:53,839 INFO L158 Benchmark]: Toolchain (without parser) took 17149.58ms. Allocated memory was 195.0MB in the beginning and 465.6MB in the end (delta: 270.5MB). Free memory was 122.2MB in the beginning and 293.8MB in the end (delta: -171.6MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-10-14 17:02:53,839 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 195.0MB. Free memory is still 151.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:02:53,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.53ms. Allocated memory is still 195.0MB. Free memory was 122.0MB in the beginning and 154.7MB in the end (delta: -32.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-10-14 17:02:53,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.51ms. Allocated memory is still 195.0MB. Free memory was 154.7MB in the beginning and 152.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:02:53,840 INFO L158 Benchmark]: Boogie Preprocessor took 34.65ms. Allocated memory is still 195.0MB. Free memory was 152.6MB in the beginning and 151.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:02:53,840 INFO L158 Benchmark]: RCFGBuilder took 330.73ms. Allocated memory is still 195.0MB. Free memory was 151.5MB in the beginning and 134.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 17:02:53,840 INFO L158 Benchmark]: TraceAbstraction took 16292.27ms. Allocated memory was 195.0MB in the beginning and 465.6MB in the end (delta: 270.5MB). Free memory was 134.8MB in the beginning and 293.8MB in the end (delta: -159.0MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-10-14 17:02:53,840 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 465.6MB. Free memory is still 293.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:02:53,841 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.15ms. Allocated memory is still 195.0MB. Free memory is still 151.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.53ms. Allocated memory is still 195.0MB. Free memory was 122.0MB in the beginning and 154.7MB in the end (delta: -32.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.51ms. Allocated memory is still 195.0MB. Free memory was 154.7MB in the beginning and 152.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.65ms. Allocated memory is still 195.0MB. Free memory was 152.6MB in the beginning and 151.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 330.73ms. Allocated memory is still 195.0MB. Free memory was 151.5MB in the beginning and 134.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16292.27ms. Allocated memory was 195.0MB in the beginning and 465.6MB in the end (delta: 270.5MB). Free memory was 134.8MB in the beginning and 293.8MB in the end (delta: -159.0MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 465.6MB. Free memory is still 293.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 704]: Data race detected Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; VAL [lock={3:0}] [L698] 0 pthread_cond_t cond; VAL [lock={3:0}] [L699] 0 int x; VAL [lock={3:0}, x=0] [L700] 0 _Bool x_set = 0; VAL [lock={3:0}, x=0, x_set=0] [L711] 0 pthread_t t; VAL [lock={3:0}, x=0, x_set=0] [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 int i = 0; VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 i++ VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=1, lock={3:0}, t=-1, x=1, x_set=0] [L713] 0 i++ VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L714] 0 x = i VAL [i=2, lock={3:0}, t=-1, x=2, x_set=0] [L713] 0 i++ VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L714] 0 x = i VAL [i=3, lock={3:0}, t=-1, x=3, x_set=0] [L713] 0 i++ VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L714] 0 x = i VAL [i=4, lock={3:0}, t=-1, x=4, x_set=0] [L713] 0 i++ VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L714] 0 x = i VAL [i=5, lock={3:0}, t=-1, x=5, x_set=0] [L713] 0 i++ VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L714] 0 x = i VAL [i=6, lock={3:0}, t=-1, x=6, x_set=0] [L713] 0 i++ VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L714] 0 x = i VAL [i=7, lock={3:0}, t=-1, x=7, x_set=0] [L713] 0 i++ VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L714] 0 x = i VAL [i=8, lock={3:0}, t=-1, x=8, x_set=0] [L713] 0 i++ VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L714] 0 x = i VAL [i=9, lock={3:0}, t=-1, x=9, x_set=0] [L713] 0 i++ VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L714] 0 x = i VAL [i=10, lock={3:0}, t=-1, x=10, x_set=0] [L713] 0 i++ VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L714] 0 x = i VAL [i=11, lock={3:0}, t=-1, x=11, x_set=0] [L713] 0 i++ VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L714] 0 x = i VAL [i=12, lock={3:0}, t=-1, x=12, x_set=0] [L713] 0 i++ VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L714] 0 x = i VAL [i=13, lock={3:0}, t=-1, x=13, x_set=0] [L713] 0 i++ VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L714] 0 x = i VAL [i=14, lock={3:0}, t=-1, x=14, x_set=0] [L713] 0 i++ VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L714] 0 x = i VAL [i=15, lock={3:0}, t=-1, x=15, x_set=0] [L713] 0 i++ VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L714] 0 x = i VAL [i=16, lock={3:0}, t=-1, x=16, x_set=0] [L713] 0 i++ VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L714] 0 x = i VAL [i=17, lock={3:0}, t=-1, x=17, x_set=0] [L713] 0 i++ VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L714] 0 x = i VAL [i=18, lock={3:0}, t=-1, x=18, x_set=0] [L713] 0 i++ VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L714] 0 x = i VAL [i=19, lock={3:0}, t=-1, x=19, x_set=0] [L713] 0 i++ VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L714] 0 x = i VAL [i=20, lock={3:0}, t=-1, x=20, x_set=0] [L713] 0 i++ VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L714] 0 x = i VAL [i=21, lock={3:0}, t=-1, x=21, x_set=0] [L713] 0 i++ VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L714] 0 x = i VAL [i=22, lock={3:0}, t=-1, x=22, x_set=0] [L713] 0 i++ VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L714] 0 x = i VAL [i=23, lock={3:0}, t=-1, x=23, x_set=0] [L713] 0 i++ VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L714] 0 x = i VAL [i=24, lock={3:0}, t=-1, x=24, x_set=0] [L713] 0 i++ VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L714] 0 x = i VAL [i=25, lock={3:0}, t=-1, x=25, x_set=0] [L713] 0 i++ VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L714] 0 x = i VAL [i=26, lock={3:0}, t=-1, x=26, x_set=0] [L713] 0 i++ VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L714] 0 x = i VAL [i=27, lock={3:0}, t=-1, x=27, x_set=0] [L713] 0 i++ VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L714] 0 x = i VAL [i=28, lock={3:0}, t=-1, x=28, x_set=0] [L713] 0 i++ VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L714] 0 x = i VAL [i=29, lock={3:0}, t=-1, x=29, x_set=0] [L713] 0 i++ VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L714] 0 x = i VAL [i=30, lock={3:0}, t=-1, x=30, x_set=0] [L713] 0 i++ VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L714] 0 x = i VAL [i=31, lock={3:0}, t=-1, x=31, x_set=0] [L713] 0 i++ VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L714] 0 x = i VAL [i=32, lock={3:0}, t=-1, x=32, x_set=0] [L713] 0 i++ VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L714] 0 x = i VAL [i=33, lock={3:0}, t=-1, x=33, x_set=0] [L713] 0 i++ VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L714] 0 x = i VAL [i=34, lock={3:0}, t=-1, x=34, x_set=0] [L713] 0 i++ VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L714] 0 x = i VAL [i=35, lock={3:0}, t=-1, x=35, x_set=0] [L713] 0 i++ VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L714] 0 x = i VAL [i=36, lock={3:0}, t=-1, x=36, x_set=0] [L713] 0 i++ VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L714] 0 x = i VAL [i=37, lock={3:0}, t=-1, x=37, x_set=0] [L713] 0 i++ VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L714] 0 x = i VAL [i=38, lock={3:0}, t=-1, x=38, x_set=0] [L713] 0 i++ VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L714] 0 x = i VAL [i=39, lock={3:0}, t=-1, x=39, x_set=0] [L713] 0 i++ VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L714] 0 x = i VAL [i=40, lock={3:0}, t=-1, x=40, x_set=0] [L713] 0 i++ VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L714] 0 x = i VAL [i=41, lock={3:0}, t=-1, x=41, x_set=0] [L713] 0 i++ VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L714] 0 x = i VAL [i=42, lock={3:0}, t=-1, x=42, x_set=0] [L713] 0 i++ VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L715] 0 x_set = 1 VAL [lock={3:0}, t=-1, x=42, x_set=1] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=1] Now there is a data race on ~x_set~0 between C: x_set = 1 [715] and C: !x_set [704] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: 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: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 110 locations, 7 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: 16.1s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4002 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3940 mSDsluCounter, 396 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1999 IncrementalHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 35 mSDtfsCounter, 1999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1833 GetRequests, 1388 SyntacticMatches, 41 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13224 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1916occurred in iteration=11, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2216 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 2522 ConstructedInterpolants, 0 QuantifiedInterpolants, 5436 SizeOfPredicates, 114 NumberOfNonLiveVariables, 1477 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1/14429 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-14 17:02:53,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE