./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/airline-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-deagle/airline-20.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 012c46975e61d3a8df350de2a682cb9d47f59406509497c2ea72a562542ce55a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:03:19,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:03:19,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:03:19,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:03:19,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:03:19,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:03:19,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:03:19,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:03:19,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:03:19,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:03:19,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:03:19,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:03:19,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:03:19,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:03:19,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:03:19,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:03:19,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:03:19,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:03:19,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:03:19,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:03:19,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:03:19,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:03:19,138 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:03:19,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:03:19,139 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:03:19,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:03:19,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:03:19,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:03:19,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:03:19,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:03:19,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:03:19,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:03:19,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:03:19,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:03:19,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:03:19,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:03:19,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:03:19,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:03:19,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:03:19,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:03:19,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:03:19,145 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 -> 012c46975e61d3a8df350de2a682cb9d47f59406509497c2ea72a562542ce55a [2024-11-09 07:03:19,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:03:19,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:03:19,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:03:19,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:03:19,368 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:03:19,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/airline-20.i [2024-11-09 07:03:20,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:03:20,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:03:20,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-20.i [2024-11-09 07:03:20,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f3a5ab3/e074e589798945b7b90c103ed96a4959/FLAG09f7f3fec [2024-11-09 07:03:20,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f3a5ab3/e074e589798945b7b90c103ed96a4959 [2024-11-09 07:03:20,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:03:20,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:03:20,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:03:20,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:03:20,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:03:20,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:03:20" (1/1) ... [2024-11-09 07:03:20,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b93934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:20, skipping insertion in model container [2024-11-09 07:03:20,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:03:20" (1/1) ... [2024-11-09 07:03:20,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:03:21,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:03:21,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:03:21,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:03:21,284 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:03:21,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21 WrapperNode [2024-11-09 07:03:21,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:03:21,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:03:21,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:03:21,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:03:21,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,321 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2024-11-09 07:03:21,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:03:21,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:03:21,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:03:21,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:03:21,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:03:21,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:03:21,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:03:21,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:03:21,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (1/1) ... [2024-11-09 07:03:21,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:03:21,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:03:21,389 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-11-09 07:03:21,394 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-11-09 07:03:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:03:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:03:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 07:03:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:03:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:03:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2024-11-09 07:03:21,437 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2024-11-09 07:03:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:03:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:03:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 07:03:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:03:21,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:03:21,439 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:03:21,578 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:03:21,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:03:21,770 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:03:21,771 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:03:21,805 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:03:21,805 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:03:21,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:21 BoogieIcfgContainer [2024-11-09 07:03:21,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:03:21,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:03:21,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:03:21,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:03:21,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:03:20" (1/3) ... [2024-11-09 07:03:21,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1545cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:03:21, skipping insertion in model container [2024-11-09 07:03:21,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:21" (2/3) ... [2024-11-09 07:03:21,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1545cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:03:21, skipping insertion in model container [2024-11-09 07:03:21,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:21" (3/3) ... [2024-11-09 07:03:21,819 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-20.i [2024-11-09 07:03:21,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:03:21,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 07:03:21,832 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:03:21,875 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 07:03:21,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 99 transitions, 205 flow [2024-11-09 07:03:21,942 INFO L124 PetriNetUnfolderBase]: 11/144 cut-off events. [2024-11-09 07:03:21,942 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 07:03:21,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 11/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 70. Up to 4 conditions per place. [2024-11-09 07:03:21,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 99 transitions, 205 flow [2024-11-09 07:03:21,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 99 transitions, 205 flow [2024-11-09 07:03:21,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:03:21,975 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;@6242d67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:03:21,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 07:03:21,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:03:21,984 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-09 07:03:21,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:03:21,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:21,984 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:21,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 07:03:21,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash -694234630, now seen corresponding path program 1 times [2024-11-09 07:03:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982762068] [2024-11-09 07:03:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:21,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982762068] [2024-11-09 07:03:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982762068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:22,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:03:22,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555929272] [2024-11-09 07:03:22,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:22,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:03:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:03:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:03:22,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 99 [2024-11-09 07:03:22,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 99 transitions, 205 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-11-09 07:03:22,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:22,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 99 [2024-11-09 07:03:22,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:22,245 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2024-11-09 07:03:22,245 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-09 07:03:22,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 3/127 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 253 event pairs, 0 based on Foata normal form. 10/121 useless extension candidates. Maximal degree in co-relation 64. Up to 8 conditions per place. [2024-11-09 07:03:22,249 INFO L140 encePairwiseOnDemand]: 90/99 looper letters, 7 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2024-11-09 07:03:22,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 197 flow [2024-11-09 07:03:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:03:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 07:03:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2024-11-09 07:03:22,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2024-11-09 07:03:22,266 INFO L175 Difference]: Start difference. First operand has 95 places, 99 transitions, 205 flow. Second operand 2 states and 180 transitions. [2024-11-09 07:03:22,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 197 flow [2024-11-09 07:03:22,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:22,273 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 183 flow [2024-11-09 07:03:22,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=183, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-11-09 07:03:22,280 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2024-11-09 07:03:22,281 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 183 flow [2024-11-09 07:03:22,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-11-09 07:03:22,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:22,281 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:22,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:03:22,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 07:03:22,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1899843324, now seen corresponding path program 1 times [2024-11-09 07:03:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:22,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758223510] [2024-11-09 07:03:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:22,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758223510] [2024-11-09 07:03:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758223510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:22,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:03:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759308807] [2024-11-09 07:03:22,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:22,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:22,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99 [2024-11-09 07:03:22,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-11-09 07:03:22,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:22,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99 [2024-11-09 07:03:22,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:22,537 INFO L124 PetriNetUnfolderBase]: 10/174 cut-off events. [2024-11-09 07:03:22,537 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:03:22,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 174 events. 10/174 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 441 event pairs, 0 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 203. Up to 23 conditions per place. [2024-11-09 07:03:22,539 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 13 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-11-09 07:03:22,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 217 flow [2024-11-09 07:03:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2024-11-09 07:03:22,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8215488215488216 [2024-11-09 07:03:22,541 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 3 states and 244 transitions. [2024-11-09 07:03:22,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 217 flow [2024-11-09 07:03:22,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:22,544 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 191 flow [2024-11-09 07:03:22,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-11-09 07:03:22,545 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2024-11-09 07:03:22,546 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 191 flow [2024-11-09 07:03:22,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-11-09 07:03:22,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:22,546 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:22,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:03:22,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 07:03:22,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:22,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1901875597, now seen corresponding path program 1 times [2024-11-09 07:03:22,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:22,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188800716] [2024-11-09 07:03:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188800716] [2024-11-09 07:03:22,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188800716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:22,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:22,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313727234] [2024-11-09 07:03:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:22,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:22,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:22,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:22,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:23,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 99 [2024-11-09 07:03:23,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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-11-09 07:03:23,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:23,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 99 [2024-11-09 07:03:23,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:23,170 INFO L124 PetriNetUnfolderBase]: 33/198 cut-off events. [2024-11-09 07:03:23,170 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-09 07:03:23,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 198 events. 33/198 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 653 event pairs, 9 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 292. Up to 56 conditions per place. [2024-11-09 07:03:23,171 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 28 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2024-11-09 07:03:23,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 271 flow [2024-11-09 07:03:23,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2024-11-09 07:03:23,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6936026936026936 [2024-11-09 07:03:23,177 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 191 flow. Second operand 6 states and 412 transitions. [2024-11-09 07:03:23,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 271 flow [2024-11-09 07:03:23,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 95 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:23,184 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 195 flow [2024-11-09 07:03:23,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2024-11-09 07:03:23,184 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2024-11-09 07:03:23,185 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 195 flow [2024-11-09 07:03:23,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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-11-09 07:03:23,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:23,186 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] [2024-11-09 07:03:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:03:23,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 07:03:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -517437541, now seen corresponding path program 1 times [2024-11-09 07:03:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899266089] [2024-11-09 07:03:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:23,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:23,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899266089] [2024-11-09 07:03:23,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899266089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:23,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:23,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:23,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616905472] [2024-11-09 07:03:23,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:23,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:23,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:23,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:23,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:23,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 99 [2024-11-09 07:03:23,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-11-09 07:03:23,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:23,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 99 [2024-11-09 07:03:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:23,250 INFO L124 PetriNetUnfolderBase]: 1/154 cut-off events. [2024-11-09 07:03:23,250 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-11-09 07:03:23,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 154 events. 1/154 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 309 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 179. Up to 7 conditions per place. [2024-11-09 07:03:23,251 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 8 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-11-09 07:03:23,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 218 flow [2024-11-09 07:03:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-11-09 07:03:23,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.835016835016835 [2024-11-09 07:03:23,254 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 195 flow. Second operand 3 states and 248 transitions. [2024-11-09 07:03:23,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 218 flow [2024-11-09 07:03:23,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 208 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:23,255 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 187 flow [2024-11-09 07:03:23,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2024-11-09 07:03:23,259 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2024-11-09 07:03:23,259 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 187 flow [2024-11-09 07:03:23,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-11-09 07:03:23,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:23,260 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] [2024-11-09 07:03:23,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:03:23,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 07:03:23,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash -343848704, now seen corresponding path program 1 times [2024-11-09 07:03:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492072542] [2024-11-09 07:03:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:23,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:23,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492072542] [2024-11-09 07:03:23,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492072542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:23,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:23,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:23,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504526532] [2024-11-09 07:03:23,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:23,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:23,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99 [2024-11-09 07:03:23,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-11-09 07:03:23,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:23,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99 [2024-11-09 07:03:23,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:23,330 INFO L124 PetriNetUnfolderBase]: 8/228 cut-off events. [2024-11-09 07:03:23,331 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2024-11-09 07:03:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 228 events. 8/228 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 817 event pairs, 4 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 272. Up to 25 conditions per place. [2024-11-09 07:03:23,334 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 12 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-11-09 07:03:23,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 228 flow [2024-11-09 07:03:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-11-09 07:03:23,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8282828282828283 [2024-11-09 07:03:23,336 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 187 flow. Second operand 3 states and 246 transitions. [2024-11-09 07:03:23,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 228 flow [2024-11-09 07:03:23,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:23,338 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 211 flow [2024-11-09 07:03:23,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=87, 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=211, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2024-11-09 07:03:23,339 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2024-11-09 07:03:23,339 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 211 flow [2024-11-09 07:03:23,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-11-09 07:03:23,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:23,341 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-11-09 07:03:23,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:03:23,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 07:03:23,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash -773710453, now seen corresponding path program 1 times [2024-11-09 07:03:23,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:23,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70395791] [2024-11-09 07:03:23,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:23,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70395791] [2024-11-09 07:03:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70395791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:03:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797853423] [2024-11-09 07:03:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:23,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:23,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:03:23,427 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-11-09 07:03:23,431 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-11-09 07:03:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:23,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:03:23,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:03:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:23,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:03:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797853423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:03:23,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:03:23,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 07:03:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072530338] [2024-11-09 07:03:23,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:03:23,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:03:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:03:23,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:03:23,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 99 [2024-11-09 07:03:23,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 211 flow. Second operand has 10 states, 10 states have (on average 75.4) internal successors, (754), 10 states have internal predecessors, (754), 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-11-09 07:03:23,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:23,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 99 [2024-11-09 07:03:23,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:23,767 INFO L124 PetriNetUnfolderBase]: 9/101 cut-off events. [2024-11-09 07:03:23,767 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-09 07:03:23,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 101 events. 9/101 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 194 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2024-11-09 07:03:23,768 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 15 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-11-09 07:03:23,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 182 flow [2024-11-09 07:03:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2024-11-09 07:03:23,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7710437710437711 [2024-11-09 07:03:23,770 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 211 flow. Second operand 6 states and 458 transitions. [2024-11-09 07:03:23,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 182 flow [2024-11-09 07:03:23,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 59 transitions, 160 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:23,772 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 116 flow [2024-11-09 07:03:23,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-11-09 07:03:23,774 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -36 predicate places. [2024-11-09 07:03:23,775 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 116 flow [2024-11-09 07:03:23,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.4) internal successors, (754), 10 states have internal predecessors, (754), 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-11-09 07:03:23,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:23,776 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-11-09 07:03:23,796 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-11-09 07:03:23,977 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-11-09 07:03:23,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 07:03:23,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash -542448446, now seen corresponding path program 1 times [2024-11-09 07:03:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:23,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307939296] [2024-11-09 07:03:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:03:24,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:03:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:03:24,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:03:24,050 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:03:24,051 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-11-09 07:03:24,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-09 07:03:24,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-09 07:03:24,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-09 07:03:24,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-09 07:03:24,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-09 07:03:24,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-09 07:03:24,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-09 07:03:24,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-09 07:03:24,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-09 07:03:24,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-09 07:03:24,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-09 07:03:24,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-09 07:03:24,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-09 07:03:24,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-09 07:03:24,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:03:24,056 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:24,058 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 07:03:24,061 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 07:03:24,074 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 07:03:24,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 120 transitions, 256 flow [2024-11-09 07:03:24,097 INFO L124 PetriNetUnfolderBase]: 22/256 cut-off events. [2024-11-09 07:03:24,097 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:03:24,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 256 events. 22/256 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 600 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2024-11-09 07:03:24,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 120 transitions, 256 flow [2024-11-09 07:03:24,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 120 transitions, 256 flow [2024-11-09 07:03:24,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:03:24,102 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;@6242d67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:03:24,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-09 07:03:24,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:03:24,104 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-09 07:03:24,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:03:24,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:24,104 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:24,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:24,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:24,105 INFO L85 PathProgramCache]: Analyzing trace with hash 424036858, now seen corresponding path program 1 times [2024-11-09 07:03:24,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:24,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105706130] [2024-11-09 07:03:24,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:24,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:24,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105706130] [2024-11-09 07:03:24,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105706130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:24,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:03:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020111055] [2024-11-09 07:03:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:24,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:03:24,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:24,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:03:24,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:03:24,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2024-11-09 07:03:24,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 120 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-11-09 07:03:24,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:24,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2024-11-09 07:03:24,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:24,154 INFO L124 PetriNetUnfolderBase]: 19/254 cut-off events. [2024-11-09 07:03:24,154 INFO L125 PetriNetUnfolderBase]: For 37/43 co-relation queries the response was YES. [2024-11-09 07:03:24,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 254 events. 19/254 cut-off events. For 37/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 732 event pairs, 4 based on Foata normal form. 26/246 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place. [2024-11-09 07:03:24,156 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 11 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2024-11-09 07:03:24,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 252 flow [2024-11-09 07:03:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:03:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 07:03:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 216 transitions. [2024-11-09 07:03:24,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9 [2024-11-09 07:03:24,160 INFO L175 Difference]: Start difference. First operand has 115 places, 120 transitions, 256 flow. Second operand 2 states and 216 transitions. [2024-11-09 07:03:24,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 252 flow [2024-11-09 07:03:24,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:24,163 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 230 flow [2024-11-09 07:03:24,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=230, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2024-11-09 07:03:24,164 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places. [2024-11-09 07:03:24,165 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 230 flow [2024-11-09 07:03:24,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-11-09 07:03:24,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:24,166 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] [2024-11-09 07:03:24,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:03:24,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:24,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1451332092, now seen corresponding path program 1 times [2024-11-09 07:03:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:24,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756145556] [2024-11-09 07:03:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756145556] [2024-11-09 07:03:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756145556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:24,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:03:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387908797] [2024-11-09 07:03:24,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:24,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:24,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2024-11-09 07:03:24,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-11-09 07:03:24,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:24,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2024-11-09 07:03:24,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:24,262 INFO L124 PetriNetUnfolderBase]: 60/451 cut-off events. [2024-11-09 07:03:24,262 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-09 07:03:24,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 451 events. 60/451 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2086 event pairs, 24 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 568. Up to 97 conditions per place. [2024-11-09 07:03:24,266 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 18 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-11-09 07:03:24,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 276 flow [2024-11-09 07:03:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2024-11-09 07:03:24,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-11-09 07:03:24,267 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 294 transitions. [2024-11-09 07:03:24,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 276 flow [2024-11-09 07:03:24,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:24,270 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 242 flow [2024-11-09 07:03:24,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-11-09 07:03:24,272 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2024-11-09 07:03:24,272 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 242 flow [2024-11-09 07:03:24,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-11-09 07:03:24,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:24,273 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:24,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:03:24,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:24,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1947140101, now seen corresponding path program 1 times [2024-11-09 07:03:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942042821] [2024-11-09 07:03:24,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:24,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:24,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942042821] [2024-11-09 07:03:24,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942042821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:24,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:24,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:24,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386734516] [2024-11-09 07:03:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:24,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:24,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:24,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:24,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 120 [2024-11-09 07:03:24,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-11-09 07:03:24,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:24,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 120 [2024-11-09 07:03:24,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:24,673 INFO L124 PetriNetUnfolderBase]: 185/628 cut-off events. [2024-11-09 07:03:24,673 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-09 07:03:24,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 628 events. 185/628 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3492 event pairs, 55 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 974. Up to 214 conditions per place. [2024-11-09 07:03:24,679 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 41 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2024-11-09 07:03:24,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 364 flow [2024-11-09 07:03:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2024-11-09 07:03:24,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7138888888888889 [2024-11-09 07:03:24,681 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 242 flow. Second operand 6 states and 514 transitions. [2024-11-09 07:03:24,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 364 flow [2024-11-09 07:03:24,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:03:24,683 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 248 flow [2024-11-09 07:03:24,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-11-09 07:03:24,684 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -2 predicate places. [2024-11-09 07:03:24,685 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 248 flow [2024-11-09 07:03:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-11-09 07:03:24,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:24,686 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] [2024-11-09 07:03:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:03:24,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:24,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:24,686 INFO L85 PathProgramCache]: Analyzing trace with hash -709870816, now seen corresponding path program 1 times [2024-11-09 07:03:24,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168632485] [2024-11-09 07:03:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168632485] [2024-11-09 07:03:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168632485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:24,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:24,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244793037] [2024-11-09 07:03:24,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:24,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:24,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2024-11-09 07:03:24,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-11-09 07:03:24,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:24,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2024-11-09 07:03:24,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:24,796 INFO L124 PetriNetUnfolderBase]: 60/772 cut-off events. [2024-11-09 07:03:24,796 INFO L125 PetriNetUnfolderBase]: For 122/386 co-relation queries the response was YES. [2024-11-09 07:03:24,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 772 events. 60/772 cut-off events. For 122/386 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5064 event pairs, 9 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 951. Up to 62 conditions per place. [2024-11-09 07:03:24,801 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 22 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2024-11-09 07:03:24,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 337 flow [2024-11-09 07:03:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-11-09 07:03:24,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2024-11-09 07:03:24,803 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 248 flow. Second operand 3 states and 303 transitions. [2024-11-09 07:03:24,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 337 flow [2024-11-09 07:03:24,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 327 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:24,805 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 290 flow [2024-11-09 07:03:24,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2024-11-09 07:03:24,806 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2024-11-09 07:03:24,806 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 290 flow [2024-11-09 07:03:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-11-09 07:03:24,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:24,806 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] [2024-11-09 07:03:24,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:03:24,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:24,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 657915091, now seen corresponding path program 1 times [2024-11-09 07:03:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:24,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319679755] [2024-11-09 07:03:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:24,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319679755] [2024-11-09 07:03:24,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319679755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846766458] [2024-11-09 07:03:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:24,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:24,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:24,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2024-11-09 07:03:24,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-11-09 07:03:24,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:24,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2024-11-09 07:03:24,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:25,027 INFO L124 PetriNetUnfolderBase]: 273/1920 cut-off events. [2024-11-09 07:03:25,027 INFO L125 PetriNetUnfolderBase]: For 374/820 co-relation queries the response was YES. [2024-11-09 07:03:25,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1920 events. 273/1920 cut-off events. For 374/820 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16766 event pairs, 93 based on Foata normal form. 1/1652 useless extension candidates. Maximal degree in co-relation 2702. Up to 395 conditions per place. [2024-11-09 07:03:25,037 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 27 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2024-11-09 07:03:25,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 405 flow [2024-11-09 07:03:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-11-09 07:03:25,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-09 07:03:25,039 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 290 flow. Second operand 3 states and 300 transitions. [2024-11-09 07:03:25,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 405 flow [2024-11-09 07:03:25,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 126 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:25,043 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 348 flow [2024-11-09 07:03:25,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2024-11-09 07:03:25,044 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places. [2024-11-09 07:03:25,045 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 348 flow [2024-11-09 07:03:25,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-11-09 07:03:25,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:25,045 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-11-09 07:03:25,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:03:25,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:25,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1536806754, now seen corresponding path program 1 times [2024-11-09 07:03:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692376920] [2024-11-09 07:03:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:25,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692376920] [2024-11-09 07:03:25,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692376920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:03:25,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539144205] [2024-11-09 07:03:25,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:25,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:25,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:03:25,120 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-11-09 07:03:25,128 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-11-09 07:03:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:25,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:03:25,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:03:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:25,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:03:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:25,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539144205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:03:25,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:03:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 07:03:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214904996] [2024-11-09 07:03:25,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:03:25,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:03:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:25,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:03:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:03:25,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2024-11-09 07:03:25,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 348 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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-11-09 07:03:25,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:25,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2024-11-09 07:03:25,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:25,488 INFO L124 PetriNetUnfolderBase]: 168/824 cut-off events. [2024-11-09 07:03:25,489 INFO L125 PetriNetUnfolderBase]: For 366/427 co-relation queries the response was YES. [2024-11-09 07:03:25,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 824 events. 168/824 cut-off events. For 366/427 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5933 event pairs, 5 based on Foata normal form. 37/806 useless extension candidates. Maximal degree in co-relation 1449. Up to 104 conditions per place. [2024-11-09 07:03:25,492 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 47 selfloop transitions, 7 changer transitions 0/119 dead transitions. [2024-11-09 07:03:25,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 119 transitions, 508 flow [2024-11-09 07:03:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:03:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 07:03:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 832 transitions. [2024-11-09 07:03:25,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7703703703703704 [2024-11-09 07:03:25,498 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 348 flow. Second operand 9 states and 832 transitions. [2024-11-09 07:03:25,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 119 transitions, 508 flow [2024-11-09 07:03:25,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 119 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:25,503 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 260 flow [2024-11-09 07:03:25,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2024-11-09 07:03:25,503 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -27 predicate places. [2024-11-09 07:03:25,504 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 260 flow [2024-11-09 07:03:25,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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-11-09 07:03:25,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:25,504 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:03:25,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:03:25,705 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,SelfDestructingSolverStorable12 [2024-11-09 07:03:25,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:25,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1661324039, now seen corresponding path program 1 times [2024-11-09 07:03:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062813690] [2024-11-09 07:03:25,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:25,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 07:03:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:25,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062813690] [2024-11-09 07:03:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062813690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:25,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:03:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252423928] [2024-11-09 07:03:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:25,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:03:25,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:03:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:03:25,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2024-11-09 07:03:25,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-11-09 07:03:25,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:25,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2024-11-09 07:03:25,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:25,834 INFO L124 PetriNetUnfolderBase]: 28/295 cut-off events. [2024-11-09 07:03:25,835 INFO L125 PetriNetUnfolderBase]: For 44/46 co-relation queries the response was YES. [2024-11-09 07:03:25,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 295 events. 28/295 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1438 event pairs, 4 based on Foata normal form. 7/284 useless extension candidates. Maximal degree in co-relation 461. Up to 29 conditions per place. [2024-11-09 07:03:25,837 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 23 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-11-09 07:03:25,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 363 flow [2024-11-09 07:03:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:03:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:03:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2024-11-09 07:03:25,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8216666666666667 [2024-11-09 07:03:25,838 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 260 flow. Second operand 5 states and 493 transitions. [2024-11-09 07:03:25,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 363 flow [2024-11-09 07:03:25,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 97 transitions, 348 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:25,841 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 280 flow [2024-11-09 07:03:25,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-11-09 07:03:25,843 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -26 predicate places. [2024-11-09 07:03:25,843 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 280 flow [2024-11-09 07:03:25,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-11-09 07:03:25,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:25,844 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:03:25,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:03:25,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:25,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 659768417, now seen corresponding path program 1 times [2024-11-09 07:03:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:25,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154839314] [2024-11-09 07:03:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 07:03:25,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:25,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154839314] [2024-11-09 07:03:25,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154839314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:25,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:03:25,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559658446] [2024-11-09 07:03:25,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:25,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:03:25,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:25,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:03:25,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:03:25,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2024-11-09 07:03:25,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-11-09 07:03:25,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:25,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2024-11-09 07:03:25,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:25,958 INFO L124 PetriNetUnfolderBase]: 22/261 cut-off events. [2024-11-09 07:03:25,959 INFO L125 PetriNetUnfolderBase]: For 108/116 co-relation queries the response was YES. [2024-11-09 07:03:25,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 261 events. 22/261 cut-off events. For 108/116 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1072 event pairs, 4 based on Foata normal form. 12/264 useless extension candidates. Maximal degree in co-relation 449. Up to 33 conditions per place. [2024-11-09 07:03:25,960 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 19 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-11-09 07:03:25,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 94 transitions, 361 flow [2024-11-09 07:03:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:03:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:03:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2024-11-09 07:03:25,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.815 [2024-11-09 07:03:25,962 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 280 flow. Second operand 5 states and 489 transitions. [2024-11-09 07:03:25,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 94 transitions, 361 flow [2024-11-09 07:03:25,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:03:25,964 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 314 flow [2024-11-09 07:03:25,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-11-09 07:03:25,965 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -21 predicate places. [2024-11-09 07:03:25,965 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 314 flow [2024-11-09 07:03:25,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-11-09 07:03:25,966 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:25,966 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:03:25,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:03:25,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-09 07:03:25,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1201801134, now seen corresponding path program 1 times [2024-11-09 07:03:25,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:25,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667388469] [2024-11-09 07:03:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:03:25,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:03:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:03:25,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:03:25,990 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:03:25,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2024-11-09 07:03:25,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2024-11-09 07:03:25,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2024-11-09 07:03:25,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2024-11-09 07:03:25,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2024-11-09 07:03:25,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2024-11-09 07:03:25,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2024-11-09 07:03:25,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2024-11-09 07:03:25,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2024-11-09 07:03:25,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:03:25,992 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:26,036 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-09 07:03:26,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:03:26,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:03:26 BasicIcfg [2024-11-09 07:03:26,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:03:26,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:03:26,043 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:03:26,043 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:03:26,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:21" (3/4) ... [2024-11-09 07:03:26,044 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 07:03:26,100 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:03:26,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:03:26,101 INFO L158 Benchmark]: Toolchain (without parser) took 5278.16ms. Allocated memory was 151.0MB in the beginning and 253.8MB in the end (delta: 102.8MB). Free memory was 77.1MB in the beginning and 94.0MB in the end (delta: -16.9MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2024-11-09 07:03:26,101 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:03:26,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.53ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 76.9MB in the beginning and 157.0MB in the end (delta: -80.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-09 07:03:26,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.40ms. Allocated memory is still 195.0MB. Free memory was 157.0MB in the beginning and 154.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:03:26,102 INFO L158 Benchmark]: Boogie Preprocessor took 30.62ms. Allocated memory is still 195.0MB. Free memory was 154.9MB in the beginning and 152.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:03:26,102 INFO L158 Benchmark]: RCFGBuilder took 451.38ms. Allocated memory is still 195.0MB. Free memory was 152.8MB in the beginning and 132.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:03:26,103 INFO L158 Benchmark]: TraceAbstraction took 4230.18ms. Allocated memory was 195.0MB in the beginning and 253.8MB in the end (delta: 58.7MB). Free memory was 132.9MB in the beginning and 105.5MB in the end (delta: 27.3MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2024-11-09 07:03:26,103 INFO L158 Benchmark]: Witness Printer took 57.87ms. Allocated memory is still 253.8MB. Free memory was 105.5MB in the beginning and 94.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:03:26,104 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.16ms. Allocated memory is still 151.0MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.53ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 76.9MB in the beginning and 157.0MB in the end (delta: -80.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.40ms. Allocated memory is still 195.0MB. Free memory was 157.0MB in the beginning and 154.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.62ms. Allocated memory is still 195.0MB. Free memory was 154.9MB in the beginning and 152.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 451.38ms. Allocated memory is still 195.0MB. Free memory was 152.8MB in the beginning and 132.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4230.18ms. Allocated memory was 195.0MB in the beginning and 253.8MB in the end (delta: 58.7MB). Free memory was 132.9MB in the beginning and 105.5MB in the end (delta: 27.3MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. * Witness Printer took 57.87ms. Allocated memory is still 253.8MB. Free memory was 105.5MB in the beginning and 94.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[20]; VAL [\old(argc)=82, \old(argv)={86:83}, argc=82, numOfTickets=0, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L738] 0 numOfTickets = 20 VAL [\old(argc)=82, \old(argv)={86:83}, argc=82, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=82, \old(argv)={86:83}, argc=82, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=82, \old(argv)={86:83}, argc=82, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=82, \old(argv)={86:83}, argc=82, i=0, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 20 VAL [\old(argc)=82, \old(argv)={86:83}, argc=82, i=0, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=82, \old(argv)={86:83}, argc=82, i=0, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=82, \old(argv)={86:83}, argc=82, i=0, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L746] 0 i++ VAL [\old(arg)={0:0}, \old(argc)=82, \old(argv)={86:83}, arg={0:0}, argc=82, i=1, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 20 VAL [\old(arg)={0:0}, \old(argc)=82, \old(argv)={86:83}, arg={0:0}, argc=82, i=1, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=82, \old(argv)={86:83}, arg={0:0}, argc=82, i=1, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=82, \old(argv)={86:83}, arg={0:0}, argc=82, i=1, numOfTickets=20, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (20 - (((20 / 10) == 0) ? 1 : (20 / 10)))) VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=20, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=20, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 111 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 356 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 499 SizeOfPredicates, 2 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 129 locations, 19 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 16 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 775 SizeOfPredicates, 2 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 22/25 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-11-09 07:03:26,126 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