./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race.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 ec72a571c515701a06aa24404f70bcf9f40028e7df85d67cfca81a233c8469ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:04:48,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:04:48,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:04:48,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:04:48,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:04:48,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:04:48,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:04:48,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:04:48,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:04:48,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:04:48,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:04:48,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:04:48,113 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:04:48,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:04:48,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:04:48,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:04:48,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:04:48,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:04:48,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:04:48,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:04:48,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:04:48,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:04:48,135 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:04:48,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:04:48,139 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:04:48,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:04:48,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:04:48,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:04:48,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:04:48,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:04:48,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:04:48,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:04:48,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:04:48,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:04:48,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:04:48,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:04:48,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:04:48,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:04:48,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:04:48,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:04:48,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:04:48,143 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 -> ec72a571c515701a06aa24404f70bcf9f40028e7df85d67cfca81a233c8469ca [2024-10-13 10:04:48,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:04:48,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:04:48,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:04:48,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:04:48,353 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:04:48,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race.i [2024-10-13 10:04:49,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:04:50,053 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:04:50,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race.i [2024-10-13 10:04:50,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefe9cb15/69dd9350d512496ba83fba352efcdc1e/FLAG3a0570462 [2024-10-13 10:04:50,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefe9cb15/69dd9350d512496ba83fba352efcdc1e [2024-10-13 10:04:50,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:04:50,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:04:50,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:04:50,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:04:50,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:04:50,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6fb9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50, skipping insertion in model container [2024-10-13 10:04:50,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:04:50,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:04:50,777 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:04:50,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:04:50,863 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:04:50,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50 WrapperNode [2024-10-13 10:04:50,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:04:50,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:04:50,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:04:50,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:04:50,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,931 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-13 10:04:50,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:04:50,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:04:50,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:04:50,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:04:50,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:50,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:04:50,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:04:50,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:04:50,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:04:50,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (1/1) ... [2024-10-13 10:04:51,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:04:51,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:51,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:04:51,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:04:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:04:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 10:04:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:04:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:04:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 10:04:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:04:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:04:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:04:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-13 10:04:51,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-13 10:04:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:04:51,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:04:51,078 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:04:51,172 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:04:51,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:04:51,345 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:04:51,345 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:04:51,360 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:04:51,360 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:04:51,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:04:51 BoogieIcfgContainer [2024-10-13 10:04:51,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:04:51,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:04:51,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:04:51,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:04:51,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:04:50" (1/3) ... [2024-10-13 10:04:51,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394a25e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:04:51, skipping insertion in model container [2024-10-13 10:04:51,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:04:50" (2/3) ... [2024-10-13 10:04:51,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394a25e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:04:51, skipping insertion in model container [2024-10-13 10:04:51,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:04:51" (3/3) ... [2024-10-13 10:04:51,367 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race.i [2024-10-13 10:04:51,380 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:04:51,381 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 10:04:51,381 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:04:51,427 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 10:04:51,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 91 transitions, 189 flow [2024-10-13 10:04:51,502 INFO L124 PetriNetUnfolderBase]: 6/125 cut-off events. [2024-10-13 10:04:51,502 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 10:04:51,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 125 events. 6/125 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2024-10-13 10:04:51,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 91 transitions, 189 flow [2024-10-13 10:04:51,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 91 transitions, 189 flow [2024-10-13 10:04:51,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:04:51,528 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;@3688aad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:04:51,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 10:04:51,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:04:51,540 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-13 10:04:51,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:04:51,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:51,541 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] [2024-10-13 10:04:51,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-13 10:04:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 637167217, now seen corresponding path program 1 times [2024-10-13 10:04:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:51,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356349930] [2024-10-13 10:04:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:51,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356349930] [2024-10-13 10:04:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356349930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:51,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:51,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:04:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622658626] [2024-10-13 10:04:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:51,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:04:51,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:51,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:04:51,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:04:51,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2024-10-13 10:04:51,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:51,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:51,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2024-10-13 10:04:51,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:52,009 INFO L124 PetriNetUnfolderBase]: 8/163 cut-off events. [2024-10-13 10:04:52,010 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-13 10:04:52,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 163 events. 8/163 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 414 event pairs, 1 based on Foata normal form. 8/154 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2024-10-13 10:04:52,013 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 8 selfloop transitions, 3 changer transitions 2/92 dead transitions. [2024-10-13 10:04:52,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 215 flow [2024-10-13 10:04:52,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:04:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:04:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2024-10-13 10:04:52,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377289377289377 [2024-10-13 10:04:52,026 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 189 flow. Second operand 3 states and 256 transitions. [2024-10-13 10:04:52,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 215 flow [2024-10-13 10:04:52,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:04:52,034 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 203 flow [2024-10-13 10:04:52,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-10-13 10:04:52,040 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2024-10-13 10:04:52,040 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 203 flow [2024-10-13 10:04:52,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:52,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:52,041 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-10-13 10:04:52,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:04:52,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-13 10:04:52,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1740217746, now seen corresponding path program 1 times [2024-10-13 10:04:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531107018] [2024-10-13 10:04:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:52,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531107018] [2024-10-13 10:04:52,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531107018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:52,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:52,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:04:52,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966715550] [2024-10-13 10:04:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:52,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:04:52,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:04:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:04:52,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2024-10-13 10:04:52,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:52,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:52,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2024-10-13 10:04:52,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:52,909 INFO L124 PetriNetUnfolderBase]: 31/245 cut-off events. [2024-10-13 10:04:52,909 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 10:04:52,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 245 events. 31/245 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1068 event pairs, 11 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 277. Up to 62 conditions per place. [2024-10-13 10:04:52,911 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 24 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2024-10-13 10:04:52,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 275 flow [2024-10-13 10:04:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2024-10-13 10:04:52,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7802197802197802 [2024-10-13 10:04:52,915 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 203 flow. Second operand 6 states and 426 transitions. [2024-10-13 10:04:52,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 275 flow [2024-10-13 10:04:52,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:04:52,920 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 205 flow [2024-10-13 10:04:52,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-10-13 10:04:52,921 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2024-10-13 10:04:52,921 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 205 flow [2024-10-13 10:04:52,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:52,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:52,922 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-10-13 10:04:52,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:04:52,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-13 10:04:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2045412567, now seen corresponding path program 1 times [2024-10-13 10:04:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621417485] [2024-10-13 10:04:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:52,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621417485] [2024-10-13 10:04:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621417485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:04:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129199759] [2024-10-13 10:04:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:53,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:04:53,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:04:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:04:53,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2024-10-13 10:04:53,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:53,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:53,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2024-10-13 10:04:53,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:53,138 INFO L124 PetriNetUnfolderBase]: 17/232 cut-off events. [2024-10-13 10:04:53,138 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 10:04:53,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 232 events. 17/232 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 805 event pairs, 1 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2024-10-13 10:04:53,141 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 15 selfloop transitions, 2 changer transitions 5/95 dead transitions. [2024-10-13 10:04:53,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 263 flow [2024-10-13 10:04:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2024-10-13 10:04:53,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8443223443223443 [2024-10-13 10:04:53,143 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 205 flow. Second operand 6 states and 461 transitions. [2024-10-13 10:04:53,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 263 flow [2024-10-13 10:04:53,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 253 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:04:53,148 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 213 flow [2024-10-13 10:04:53,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, 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=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2024-10-13 10:04:53,149 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2024-10-13 10:04:53,149 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 213 flow [2024-10-13 10:04:53,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:53,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:53,150 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:53,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:04:53,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-13 10:04:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 79107010, now seen corresponding path program 1 times [2024-10-13 10:04:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:53,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392190174] [2024-10-13 10:04:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:53,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:53,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392190174] [2024-10-13 10:04:53,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392190174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:53,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:53,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:04:53,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724201357] [2024-10-13 10:04:53,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:53,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:04:53,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:53,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:04:53,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:04:53,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2024-10-13 10:04:53,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:53,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:53,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2024-10-13 10:04:53,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:53,224 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2024-10-13 10:04:53,224 INFO L125 PetriNetUnfolderBase]: For 19/32 co-relation queries the response was YES. [2024-10-13 10:04:53,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 169 events. 5/169 cut-off events. For 19/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 475 event pairs, 3 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2024-10-13 10:04:53,226 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 8 selfloop transitions, 4 changer transitions 3/91 dead transitions. [2024-10-13 10:04:53,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 249 flow [2024-10-13 10:04:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:04:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:04:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-10-13 10:04:53,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2024-10-13 10:04:53,229 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 213 flow. Second operand 3 states and 248 transitions. [2024-10-13 10:04:53,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 249 flow [2024-10-13 10:04:53,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 235 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-13 10:04:53,231 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 221 flow [2024-10-13 10:04:53,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-10-13 10:04:53,234 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2024-10-13 10:04:53,234 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 221 flow [2024-10-13 10:04:53,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:53,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:53,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:04:53,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-13 10:04:53,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash 42510031, now seen corresponding path program 1 times [2024-10-13 10:04:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:53,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687806150] [2024-10-13 10:04:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687806150] [2024-10-13 10:04:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687806150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704789975] [2024-10-13 10:04:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:53,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:53,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:04:53,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:04:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:53,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:04:53,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:53,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:53,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704789975] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:53,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:53,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 10:04:53,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472801413] [2024-10-13 10:04:53,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:53,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:04:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:04:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:04:53,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 91 [2024-10-13 10:04:53,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 221 flow. Second operand has 11 states, 11 states have (on average 70.9090909090909) internal successors, (780), 11 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:53,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:53,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 91 [2024-10-13 10:04:53,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:53,951 INFO L124 PetriNetUnfolderBase]: 21/198 cut-off events. [2024-10-13 10:04:53,952 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-10-13 10:04:53,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 198 events. 21/198 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 781 event pairs, 1 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 263. Up to 14 conditions per place. [2024-10-13 10:04:53,953 INFO L140 encePairwiseOnDemand]: 81/91 looper letters, 18 selfloop transitions, 9 changer transitions 4/90 dead transitions. [2024-10-13 10:04:53,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 284 flow [2024-10-13 10:04:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:04:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 10:04:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2024-10-13 10:04:53,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7973137973137974 [2024-10-13 10:04:53,956 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 221 flow. Second operand 9 states and 653 transitions. [2024-10-13 10:04:53,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 284 flow [2024-10-13 10:04:53,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:04:53,960 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 202 flow [2024-10-13 10:04:53,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2024-10-13 10:04:53,960 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2024-10-13 10:04:53,961 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 202 flow [2024-10-13 10:04:53,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 70.9090909090909) internal successors, (780), 11 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:53,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:53,961 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] [2024-10-13 10:04:53,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:04:54,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:54,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-13 10:04:54,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2106051217, now seen corresponding path program 1 times [2024-10-13 10:04:54,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:54,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374297115] [2024-10-13 10:04:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:04:54,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:04:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:04:54,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 10:04:54,208 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:04:54,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-13 10:04:54,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-10-13 10:04:54,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-10-13 10:04:54,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-10-13 10:04:54,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-10-13 10:04:54,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-10-13 10:04:54,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:04:54,211 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 10:04:54,214 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 10:04:54,214 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 10:04:54,235 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 10:04:54,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 109 transitions, 234 flow [2024-10-13 10:04:54,252 INFO L124 PetriNetUnfolderBase]: 11/212 cut-off events. [2024-10-13 10:04:54,252 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 10:04:54,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 212 events. 11/212 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2024-10-13 10:04:54,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 109 transitions, 234 flow [2024-10-13 10:04:54,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 109 transitions, 234 flow [2024-10-13 10:04:54,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:04:54,256 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;@3688aad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:04:54,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 10:04:54,260 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:04:54,260 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-13 10:04:54,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:04:54,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:54,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] [2024-10-13 10:04:54,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-13 10:04:54,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1540354543, now seen corresponding path program 1 times [2024-10-13 10:04:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:54,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697787989] [2024-10-13 10:04:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:54,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697787989] [2024-10-13 10:04:54,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697787989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:54,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:54,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:04:54,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778986706] [2024-10-13 10:04:54,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:54,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:04:54,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:54,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:04:54,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:04:54,287 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 109 [2024-10-13 10:04:54,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:54,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:54,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 109 [2024-10-13 10:04:54,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:54,350 INFO L124 PetriNetUnfolderBase]: 119/731 cut-off events. [2024-10-13 10:04:54,350 INFO L125 PetriNetUnfolderBase]: For 54/78 co-relation queries the response was YES. [2024-10-13 10:04:54,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 731 events. 119/731 cut-off events. For 54/78 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4271 event pairs, 50 based on Foata normal form. 36/682 useless extension candidates. Maximal degree in co-relation 749. Up to 139 conditions per place. [2024-10-13 10:04:54,354 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 16 selfloop transitions, 4 changer transitions 1/113 dead transitions. [2024-10-13 10:04:54,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 113 transitions, 282 flow [2024-10-13 10:04:54,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:04:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:04:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-10-13 10:04:54,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.926605504587156 [2024-10-13 10:04:54,355 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 234 flow. Second operand 3 states and 303 transitions. [2024-10-13 10:04:54,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 113 transitions, 282 flow [2024-10-13 10:04:54,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:04:54,356 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 256 flow [2024-10-13 10:04:54,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2024-10-13 10:04:54,357 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2024-10-13 10:04:54,357 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 256 flow [2024-10-13 10:04:54,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:54,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:54,358 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-10-13 10:04:54,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:04:54,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-13 10:04:54,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1300220009, now seen corresponding path program 1 times [2024-10-13 10:04:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634848904] [2024-10-13 10:04:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:54,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634848904] [2024-10-13 10:04:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634848904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:54,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:54,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:04:54,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292255786] [2024-10-13 10:04:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:54,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:04:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:54,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:04:54,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:04:54,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 109 [2024-10-13 10:04:54,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:54,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:54,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 109 [2024-10-13 10:04:54,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:54,609 INFO L124 PetriNetUnfolderBase]: 189/1195 cut-off events. [2024-10-13 10:04:54,609 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-10-13 10:04:54,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1195 events. 189/1195 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8575 event pairs, 131 based on Foata normal form. 1/1096 useless extension candidates. Maximal degree in co-relation 1094. Up to 314 conditions per place. [2024-10-13 10:04:54,616 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 20 selfloop transitions, 2 changer transitions 5/116 dead transitions. [2024-10-13 10:04:54,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 326 flow [2024-10-13 10:04:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2024-10-13 10:04:54,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8409785932721713 [2024-10-13 10:04:54,618 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 256 flow. Second operand 6 states and 550 transitions. [2024-10-13 10:04:54,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 326 flow [2024-10-13 10:04:54,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:04:54,622 INFO L231 Difference]: Finished difference. Result has 119 places, 109 transitions, 270 flow [2024-10-13 10:04:54,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=119, PETRI_TRANSITIONS=109} [2024-10-13 10:04:54,623 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-10-13 10:04:54,623 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 109 transitions, 270 flow [2024-10-13 10:04:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:54,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:54,624 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-10-13 10:04:54,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:04:54,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-13 10:04:54,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1605414830, now seen corresponding path program 1 times [2024-10-13 10:04:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:54,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986195832] [2024-10-13 10:04:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:54,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:54,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:54,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986195832] [2024-10-13 10:04:54,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986195832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:54,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:04:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359913123] [2024-10-13 10:04:54,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:54,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:04:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:04:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:04:54,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 109 [2024-10-13 10:04:54,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 109 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:54,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:54,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 109 [2024-10-13 10:04:54,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:55,032 INFO L124 PetriNetUnfolderBase]: 298/1282 cut-off events. [2024-10-13 10:04:55,033 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-10-13 10:04:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1282 events. 298/1282 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9634 event pairs, 130 based on Foata normal form. 0/1183 useless extension candidates. Maximal degree in co-relation 959. Up to 371 conditions per place. [2024-10-13 10:04:55,040 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 37 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2024-10-13 10:04:55,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 124 transitions, 384 flow [2024-10-13 10:04:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2024-10-13 10:04:55,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7981651376146789 [2024-10-13 10:04:55,041 INFO L175 Difference]: Start difference. First operand has 119 places, 109 transitions, 270 flow. Second operand 6 states and 522 transitions. [2024-10-13 10:04:55,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 124 transitions, 384 flow [2024-10-13 10:04:55,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 372 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 10:04:55,044 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 266 flow [2024-10-13 10:04:55,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2024-10-13 10:04:55,044 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 7 predicate places. [2024-10-13 10:04:55,045 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 266 flow [2024-10-13 10:04:55,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:55,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:55,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-10-13 10:04:55,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:04:55,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-13 10:04:55,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash -55830766, now seen corresponding path program 1 times [2024-10-13 10:04:55,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:55,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29765094] [2024-10-13 10:04:55,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29765094] [2024-10-13 10:04:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29765094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:55,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:04:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554970953] [2024-10-13 10:04:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:55,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:04:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:55,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:04:55,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:04:55,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-10-13 10:04:55,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:55,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:55,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-10-13 10:04:55,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:55,156 INFO L124 PetriNetUnfolderBase]: 170/1036 cut-off events. [2024-10-13 10:04:55,156 INFO L125 PetriNetUnfolderBase]: For 196/323 co-relation queries the response was YES. [2024-10-13 10:04:55,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 1036 events. 170/1036 cut-off events. For 196/323 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7374 event pairs, 74 based on Foata normal form. 4/903 useless extension candidates. Maximal degree in co-relation 670. Up to 268 conditions per place. [2024-10-13 10:04:55,162 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 19 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2024-10-13 10:04:55,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 350 flow [2024-10-13 10:04:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:04:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:04:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-10-13 10:04:55,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.908256880733945 [2024-10-13 10:04:55,163 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 266 flow. Second operand 3 states and 297 transitions. [2024-10-13 10:04:55,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 350 flow [2024-10-13 10:04:55,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 340 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:04:55,165 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 312 flow [2024-10-13 10:04:55,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-10-13 10:04:55,166 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places. [2024-10-13 10:04:55,166 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 312 flow [2024-10-13 10:04:55,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:55,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:55,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:04:55,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-13 10:04:55,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2098394380, now seen corresponding path program 1 times [2024-10-13 10:04:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041161573] [2024-10-13 10:04:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041161573] [2024-10-13 10:04:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041161573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578571191] [2024-10-13 10:04:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:55,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:55,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:55,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:04:55,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:04:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:55,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:04:55,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:55,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578571191] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:55,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:55,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 10:04:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148095387] [2024-10-13 10:04:55,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:04:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:04:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:04:55,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2024-10-13 10:04:55,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 312 flow. Second operand has 11 states, 11 states have (on average 84.9090909090909) internal successors, (934), 11 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:55,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:55,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2024-10-13 10:04:55,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:55,753 INFO L124 PetriNetUnfolderBase]: 338/1629 cut-off events. [2024-10-13 10:04:55,753 INFO L125 PetriNetUnfolderBase]: For 249/289 co-relation queries the response was YES. [2024-10-13 10:04:55,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2689 conditions, 1629 events. 338/1629 cut-off events. For 249/289 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 12949 event pairs, 39 based on Foata normal form. 0/1454 useless extension candidates. Maximal degree in co-relation 1415. Up to 430 conditions per place. [2024-10-13 10:04:55,762 INFO L140 encePairwiseOnDemand]: 98/109 looper letters, 40 selfloop transitions, 12 changer transitions 2/143 dead transitions. [2024-10-13 10:04:55,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 143 transitions, 482 flow [2024-10-13 10:04:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:04:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 10:04:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 885 transitions. [2024-10-13 10:04:55,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8119266055045872 [2024-10-13 10:04:55,764 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 312 flow. Second operand 10 states and 885 transitions. [2024-10-13 10:04:55,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 143 transitions, 482 flow [2024-10-13 10:04:55,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 143 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:04:55,767 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 376 flow [2024-10-13 10:04:55,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=376, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2024-10-13 10:04:55,768 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places. [2024-10-13 10:04:55,768 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 376 flow [2024-10-13 10:04:55,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.9090909090909) internal successors, (934), 11 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:55,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:55,769 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:55,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:04:55,973 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,SelfDestructingSolverStorable10 [2024-10-13 10:04:55,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-13 10:04:55,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash -582855165, now seen corresponding path program 1 times [2024-10-13 10:04:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:55,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085240572] [2024-10-13 10:04:55,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:55,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:04:55,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:04:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:04:56,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 10:04:56,009 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:04:56,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-10-13 10:04:56,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-10-13 10:04:56,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-10-13 10:04:56,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-10-13 10:04:56,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-13 10:04:56,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-10-13 10:04:56,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-10-13 10:04:56,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:04:56,010 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 10:04:56,053 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-13 10:04:56,053 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:04:56,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:04:56 BasicIcfg [2024-10-13 10:04:56,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:04:56,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:04:56,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:04:56,058 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:04:56,058 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:04:51" (3/4) ... [2024-10-13 10:04:56,060 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 10:04:56,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:04:56,061 INFO L158 Benchmark]: Toolchain (without parser) took 5747.88ms. Allocated memory was 218.1MB in the beginning and 272.6MB in the end (delta: 54.5MB). Free memory was 188.1MB in the beginning and 124.6MB in the end (delta: 63.5MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. [2024-10-13 10:04:56,061 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 125.8MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:04:56,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.92ms. Allocated memory is still 218.1MB. Free memory was 187.9MB in the beginning and 162.8MB in the end (delta: 25.1MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-10-13 10:04:56,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.21ms. Allocated memory is still 218.1MB. Free memory was 162.8MB in the beginning and 159.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:04:56,062 INFO L158 Benchmark]: Boogie Preprocessor took 53.83ms. Allocated memory is still 218.1MB. Free memory was 159.7MB in the beginning and 158.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:04:56,062 INFO L158 Benchmark]: RCFGBuilder took 369.25ms. Allocated memory is still 218.1MB. Free memory was 158.6MB in the beginning and 142.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:04:56,062 INFO L158 Benchmark]: TraceAbstraction took 4694.92ms. Allocated memory was 218.1MB in the beginning and 272.6MB in the end (delta: 54.5MB). Free memory was 140.9MB in the beginning and 125.7MB in the end (delta: 15.2MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2024-10-13 10:04:56,062 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 272.6MB. Free memory was 125.7MB in the beginning and 124.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:04:56,063 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.64ms. Allocated memory is still 125.8MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.92ms. Allocated memory is still 218.1MB. Free memory was 187.9MB in the beginning and 162.8MB in the end (delta: 25.1MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.21ms. Allocated memory is still 218.1MB. Free memory was 162.8MB in the beginning and 159.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.83ms. Allocated memory is still 218.1MB. Free memory was 159.7MB in the beginning and 158.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 369.25ms. Allocated memory is still 218.1MB. Free memory was 158.6MB in the beginning and 142.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4694.92ms. Allocated memory was 218.1MB in the beginning and 272.6MB in the end (delta: 54.5MB). Free memory was 140.9MB in the beginning and 125.7MB in the end (delta: 15.2MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 272.6MB. Free memory was 125.7MB in the beginning and 124.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1023]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 int data = 0; VAL [data=0] [L1020] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L1028] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_total=1] [L1029] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}] [L1029] RET 0 assume_abort_if_not(threads_total >= 0) [L1030] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, data_mutex={1:0}, threads_total=1, tids={-2:0}] [L1031] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1023] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=1, tids={-2:0}] [L1031] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=1, tids={-2:0}] [L1034] 0 int i = 0; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1034] COND FALSE 0 !(i < threads_total - 1) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=1, tids={-2:0}] [L1038] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=1, tids={-2:0}] [L1023] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [1038] and C: data = __VERIFIER_nondet_int() [1023] - UnprovableResult [Line: 1038]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: 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, 105 locations, 6 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.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 474 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 458 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 940 IncrementalHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 16 mSDtfsCounter, 940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 1.0s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 6 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 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, 122 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 471 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 70 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=376occurred in iteration=5, InterpolantAutomatonStates: 28, 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.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 6 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-13 10:04:56,090 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