./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/stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:45:47,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:45:48,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 16:45:48,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:45:48,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:45:48,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:45:48,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:45:48,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:45:48,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:45:48,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:45:48,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:45:48,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:45:48,090 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:45:48,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:45:48,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:45:48,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:45:48,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:45:48,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:45:48,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:45:48,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:45:48,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:45:48,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:45:48,097 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 16:45:48,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:45:48,097 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 16:45:48,097 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:45:48,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:45:48,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:45:48,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:45:48,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:45:48,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:45:48,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:45:48,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:45:48,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:45:48,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:45:48,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:45:48,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:45:48,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:45:48,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:45:48,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:45:48,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:45:48,102 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 [2024-10-11 16:45:48,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:45:48,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:45:48,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:45:48,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:45:48,409 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:45:48,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-2.i [2024-10-11 16:45:49,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:45:50,058 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:45:50,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-2.i [2024-10-11 16:45:50,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b6812b6f/a9e63d4190414664bdc3f5b1e2dd7ab4/FLAG8d47da093 [2024-10-11 16:45:50,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b6812b6f/a9e63d4190414664bdc3f5b1e2dd7ab4 [2024-10-11 16:45:50,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:45:50,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:45:50,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:45:50,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:45:50,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:45:50,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec3338d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50, skipping insertion in model container [2024-10-11 16:45:50,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:45:50,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:45:50,671 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:45:50,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:45:50,816 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:45:50,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50 WrapperNode [2024-10-11 16:45:50,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:45:50,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:45:50,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:45:50,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:45:50,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,889 INFO L138 Inliner]: procedures = 277, calls = 31, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 184 [2024-10-11 16:45:50,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:45:50,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:45:50,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:45:50,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:45:50,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:45:50,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:45:50,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:45:50,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:45:50,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (1/1) ... [2024-10-11 16:45:50,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:45:50,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:45:50,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:45:50,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:45:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 16:45:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 16:45:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 16:45:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 16:45:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 16:45:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 16:45:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 16:45:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 16:45:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:45:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 16:45:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:45:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:45:51,058 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 16:45:51,220 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:45:51,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:45:51,511 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 16:45:51,511 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:45:51,534 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:45:51,535 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 16:45:51,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:45:51 BoogieIcfgContainer [2024-10-11 16:45:51,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:45:51,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:45:51,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:45:51,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:45:51,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:45:50" (1/3) ... [2024-10-11 16:45:51,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb99d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:45:51, skipping insertion in model container [2024-10-11 16:45:51,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:45:50" (2/3) ... [2024-10-11 16:45:51,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb99d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:45:51, skipping insertion in model container [2024-10-11 16:45:51,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:45:51" (3/3) ... [2024-10-11 16:45:51,546 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2024-10-11 16:45:51,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:45:51,563 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-11 16:45:51,563 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 16:45:51,673 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 16:45:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 206 transitions, 426 flow [2024-10-11 16:45:51,792 INFO L124 PetriNetUnfolderBase]: 12/204 cut-off events. [2024-10-11 16:45:51,792 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 16:45:51,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 204 events. 12/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 487 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 173. Up to 3 conditions per place. [2024-10-11 16:45:51,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 206 transitions, 426 flow [2024-10-11 16:45:51,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 199 transitions, 407 flow [2024-10-11 16:45:51,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:45:51,827 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;@6b56660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:45:51,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-11 16:45:51,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 16:45:51,843 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2024-10-11 16:45:51,843 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 16:45:51,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:45:51,844 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] [2024-10-11 16:45:51,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2024-10-11 16:45:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:45:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1871254461, now seen corresponding path program 1 times [2024-10-11 16:45:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:45:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022119905] [2024-10-11 16:45:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:45:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:45:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:45:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:45:52,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:45:52,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022119905] [2024-10-11 16:45:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022119905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:45:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:45:52,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:45:52,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224853785] [2024-10-11 16:45:52,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:45:52,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:45:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:45:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:45:52,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:45:52,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2024-10-11 16:45:52,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 199 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:52,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:45:52,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2024-10-11 16:45:52,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:45:52,676 INFO L124 PetriNetUnfolderBase]: 274/2369 cut-off events. [2024-10-11 16:45:52,677 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2024-10-11 16:45:52,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 2369 events. 274/2369 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 17000 event pairs, 76 based on Foata normal form. 211/2336 useless extension candidates. Maximal degree in co-relation 2779. Up to 405 conditions per place. [2024-10-11 16:45:52,698 INFO L140 encePairwiseOnDemand]: 176/206 looper letters, 36 selfloop transitions, 16 changer transitions 0/208 dead transitions. [2024-10-11 16:45:52,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 208 transitions, 535 flow [2024-10-11 16:45:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:45:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:45:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2024-10-11 16:45:52,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239482200647249 [2024-10-11 16:45:52,715 INFO L175 Difference]: Start difference. First operand has 194 places, 199 transitions, 407 flow. Second operand 3 states and 571 transitions. [2024-10-11 16:45:52,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 208 transitions, 535 flow [2024-10-11 16:45:52,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 208 transitions, 527 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 16:45:52,725 INFO L231 Difference]: Finished difference. Result has 189 places, 202 transitions, 518 flow [2024-10-11 16:45:52,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=189, PETRI_TRANSITIONS=202} [2024-10-11 16:45:52,731 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, -5 predicate places. [2024-10-11 16:45:52,731 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 202 transitions, 518 flow [2024-10-11 16:45:52,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:52,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:45:52,732 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] [2024-10-11 16:45:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:45:52,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2024-10-11 16:45:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:45:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash 796456911, now seen corresponding path program 1 times [2024-10-11 16:45:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:45:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726272978] [2024-10-11 16:45:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:45:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:45:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:45:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:45:52,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:45:52,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726272978] [2024-10-11 16:45:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726272978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:45:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:45:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:45:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000138767] [2024-10-11 16:45:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:45:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:45:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:45:52,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:45:52,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:45:52,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 206 [2024-10-11 16:45:52,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 202 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:52,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:45:52,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 206 [2024-10-11 16:45:52,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:45:53,403 INFO L124 PetriNetUnfolderBase]: 277/3020 cut-off events. [2024-10-11 16:45:53,403 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2024-10-11 16:45:53,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 3020 events. 277/3020 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22770 event pairs, 91 based on Foata normal form. 22/2790 useless extension candidates. Maximal degree in co-relation 3628. Up to 350 conditions per place. [2024-10-11 16:45:53,416 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 18 selfloop transitions, 3 changer transitions 0/209 dead transitions. [2024-10-11 16:45:53,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 209 transitions, 577 flow [2024-10-11 16:45:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:45:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:45:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2024-10-11 16:45:53,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-10-11 16:45:53,423 INFO L175 Difference]: Start difference. First operand has 189 places, 202 transitions, 518 flow. Second operand 3 states and 569 transitions. [2024-10-11 16:45:53,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 209 transitions, 577 flow [2024-10-11 16:45:53,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 209 transitions, 545 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:45:53,434 INFO L231 Difference]: Finished difference. Result has 190 places, 203 transitions, 503 flow [2024-10-11 16:45:53,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=190, PETRI_TRANSITIONS=203} [2024-10-11 16:45:53,435 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, -4 predicate places. [2024-10-11 16:45:53,436 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 203 transitions, 503 flow [2024-10-11 16:45:53,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:53,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:45:53,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:45:53,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:45:53,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2024-10-11 16:45:53,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:45:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -577355261, now seen corresponding path program 1 times [2024-10-11 16:45:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:45:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40133689] [2024-10-11 16:45:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:45:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:45:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:45:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:45:54,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:45:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40133689] [2024-10-11 16:45:54,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40133689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:45:54,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:45:54,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:45:54,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936534043] [2024-10-11 16:45:54,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:45:54,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:45:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:45:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:45:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:45:54,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 206 [2024-10-11 16:45:54,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 203 transitions, 503 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:54,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:45:54,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 206 [2024-10-11 16:45:54,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:45:54,805 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][67], [Black: 204#true, 113#L1013-2true, 37#L959-1true, Black: 211#(= ~top~0 0), 213#true, 11#L1022-4true, 202#true, 209#true]) [2024-10-11 16:45:54,806 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2024-10-11 16:45:54,806 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-11 16:45:54,806 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 16:45:54,806 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-11 16:45:54,807 INFO L124 PetriNetUnfolderBase]: 556/4146 cut-off events. [2024-10-11 16:45:54,807 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-11 16:45:54,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 4146 events. 556/4146 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 33485 event pairs, 211 based on Foata normal form. 0/3807 useless extension candidates. Maximal degree in co-relation 5356. Up to 771 conditions per place. [2024-10-11 16:45:54,827 INFO L140 encePairwiseOnDemand]: 195/206 looper letters, 35 selfloop transitions, 22 changer transitions 0/236 dead transitions. [2024-10-11 16:45:54,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 236 transitions, 691 flow [2024-10-11 16:45:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:45:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 16:45:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2024-10-11 16:45:54,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8818770226537217 [2024-10-11 16:45:54,831 INFO L175 Difference]: Start difference. First operand has 190 places, 203 transitions, 503 flow. Second operand 6 states and 1090 transitions. [2024-10-11 16:45:54,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 236 transitions, 691 flow [2024-10-11 16:45:54,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 236 transitions, 688 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 16:45:54,838 INFO L231 Difference]: Finished difference. Result has 199 places, 224 transitions, 650 flow [2024-10-11 16:45:54,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=650, PETRI_PLACES=199, PETRI_TRANSITIONS=224} [2024-10-11 16:45:54,840 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, 5 predicate places. [2024-10-11 16:45:54,840 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 224 transitions, 650 flow [2024-10-11 16:45:54,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:54,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:45:54,841 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:45:54,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:45:54,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2024-10-11 16:45:54,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:45:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1254512553, now seen corresponding path program 1 times [2024-10-11 16:45:54,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:45:54,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739666102] [2024-10-11 16:45:54,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:45:54,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:45:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:45:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:45:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:45:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739666102] [2024-10-11 16:45:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739666102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:45:54,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:45:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:45:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986059819] [2024-10-11 16:45:54,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:45:54,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:45:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:45:54,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:45:54,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:45:54,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 206 [2024-10-11 16:45:54,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 224 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:54,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:45:54,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 206 [2024-10-11 16:45:54,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:45:55,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][67], [Black: 204#true, 113#L1013-2true, Black: 211#(= ~top~0 0), 224#true, 213#true, 148#L998-2true, 11#L1022-4true, Black: 215#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 216#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 202#true, Black: 217#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|))]) [2024-10-11 16:45:55,469 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-11 16:45:55,469 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-10-11 16:45:55,469 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-10-11 16:45:55,469 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-11 16:45:55,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][67], [Black: 204#true, 113#L1013-2true, Black: 211#(= ~top~0 0), 224#true, 213#true, 11#L1022-4true, Black: 215#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 127#L993-3true, Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 216#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 202#true, Black: 217#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|))]) [2024-10-11 16:45:55,484 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-10-11 16:45:55,484 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-11 16:45:55,484 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-10-11 16:45:55,485 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-10-11 16:45:55,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][67], [Black: 204#true, 113#L1013-2true, Black: 211#(= ~top~0 0), 224#true, 213#true, Black: 215#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 216#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 89#L1023-1true, 202#true, Black: 217#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|))]) [2024-10-11 16:45:55,494 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2024-10-11 16:45:55,494 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-11 16:45:55,494 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-11 16:45:55,495 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-11 16:45:55,503 INFO L124 PetriNetUnfolderBase]: 521/4205 cut-off events. [2024-10-11 16:45:55,504 INFO L125 PetriNetUnfolderBase]: For 383/434 co-relation queries the response was YES. [2024-10-11 16:45:55,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6148 conditions, 4205 events. 521/4205 cut-off events. For 383/434 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 33275 event pairs, 174 based on Foata normal form. 15/3901 useless extension candidates. Maximal degree in co-relation 5823. Up to 786 conditions per place. [2024-10-11 16:45:55,529 INFO L140 encePairwiseOnDemand]: 197/206 looper letters, 32 selfloop transitions, 13 changer transitions 0/238 dead transitions. [2024-10-11 16:45:55,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 238 transitions, 788 flow [2024-10-11 16:45:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:45:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:45:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2024-10-11 16:45:55,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8980582524271845 [2024-10-11 16:45:55,532 INFO L175 Difference]: Start difference. First operand has 199 places, 224 transitions, 650 flow. Second operand 3 states and 555 transitions. [2024-10-11 16:45:55,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 238 transitions, 788 flow [2024-10-11 16:45:55,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 238 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:45:55,540 INFO L231 Difference]: Finished difference. Result has 203 places, 235 transitions, 766 flow [2024-10-11 16:45:55,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=203, PETRI_TRANSITIONS=235} [2024-10-11 16:45:55,541 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, 9 predicate places. [2024-10-11 16:45:55,542 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 235 transitions, 766 flow [2024-10-11 16:45:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:55,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:45:55,543 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:45:55,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:45:55,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2024-10-11 16:45:55,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:45:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash -604286508, now seen corresponding path program 1 times [2024-10-11 16:45:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:45:55,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024696976] [2024-10-11 16:45:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:45:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:45:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:45:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:45:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:45:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024696976] [2024-10-11 16:45:55,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024696976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:45:55,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:45:55,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:45:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133855558] [2024-10-11 16:45:55,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:45:55,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:45:55,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:45:55,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:45:55,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:45:55,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 206 [2024-10-11 16:45:55,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 235 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:55,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:45:55,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 206 [2024-10-11 16:45:55,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:45:55,771 INFO L124 PetriNetUnfolderBase]: 33/699 cut-off events. [2024-10-11 16:45:55,772 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-10-11 16:45:55,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 699 events. 33/699 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3023 event pairs, 5 based on Foata normal form. 11/676 useless extension candidates. Maximal degree in co-relation 700. Up to 65 conditions per place. [2024-10-11 16:45:55,775 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 7 selfloop transitions, 4 changer transitions 0/182 dead transitions. [2024-10-11 16:45:55,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 182 transitions, 493 flow [2024-10-11 16:45:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:45:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:45:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2024-10-11 16:45:55,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9288025889967637 [2024-10-11 16:45:55,777 INFO L175 Difference]: Start difference. First operand has 203 places, 235 transitions, 766 flow. Second operand 3 states and 574 transitions. [2024-10-11 16:45:55,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 182 transitions, 493 flow [2024-10-11 16:45:55,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 182 transitions, 419 flow, removed 23 selfloop flow, removed 14 redundant places. [2024-10-11 16:45:55,785 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 398 flow [2024-10-11 16:45:55,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2024-10-11 16:45:55,787 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, -12 predicate places. [2024-10-11 16:45:55,788 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 398 flow [2024-10-11 16:45:55,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:55,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:45:55,789 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:45:55,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:45:55,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2024-10-11 16:45:55,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:45:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash 829501192, now seen corresponding path program 1 times [2024-10-11 16:45:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:45:55,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248424798] [2024-10-11 16:45:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:45:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:45:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:45:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:45:55,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:45:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248424798] [2024-10-11 16:45:55,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248424798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:45:55,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:45:55,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:45:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122794135] [2024-10-11 16:45:55,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:45:55,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:45:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:45:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:45:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:45:55,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 206 [2024-10-11 16:45:55,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:55,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:45:55,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 206 [2024-10-11 16:45:55,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:45:56,008 INFO L124 PetriNetUnfolderBase]: 52/713 cut-off events. [2024-10-11 16:45:56,009 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-11 16:45:56,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 713 events. 52/713 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3363 event pairs, 28 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 679. Up to 119 conditions per place. [2024-10-11 16:45:56,013 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 22 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2024-10-11 16:45:56,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 180 transitions, 447 flow [2024-10-11 16:45:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:45:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:45:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2024-10-11 16:45:56,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8818770226537217 [2024-10-11 16:45:56,015 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 398 flow. Second operand 3 states and 545 transitions. [2024-10-11 16:45:56,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 180 transitions, 447 flow [2024-10-11 16:45:56,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 180 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 16:45:56,018 INFO L231 Difference]: Finished difference. Result has 182 places, 179 transitions, 396 flow [2024-10-11 16:45:56,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=182, PETRI_TRANSITIONS=179} [2024-10-11 16:45:56,021 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, -12 predicate places. [2024-10-11 16:45:56,022 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 179 transitions, 396 flow [2024-10-11 16:45:56,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:56,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:45:56,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:45:56,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:45:56,023 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2024-10-11 16:45:56,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:45:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash -222723391, now seen corresponding path program 1 times [2024-10-11 16:45:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:45:56,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144202866] [2024-10-11 16:45:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:45:56,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:45:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:45:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:45:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:45:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144202866] [2024-10-11 16:45:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144202866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:45:56,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:45:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:45:56,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845979741] [2024-10-11 16:45:56,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:45:56,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:45:56,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:45:56,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:45:56,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:45:56,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 206 [2024-10-11 16:45:56,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 179 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:56,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:45:56,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 206 [2024-10-11 16:45:56,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:45:56,837 INFO L124 PetriNetUnfolderBase]: 51/709 cut-off events. [2024-10-11 16:45:56,837 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-10-11 16:45:56,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 709 events. 51/709 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3311 event pairs, 26 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 810. Up to 105 conditions per place. [2024-10-11 16:45:56,839 INFO L140 encePairwiseOnDemand]: 200/206 looper letters, 0 selfloop transitions, 0 changer transitions 182/182 dead transitions. [2024-10-11 16:45:56,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 182 transitions, 456 flow [2024-10-11 16:45:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:45:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 16:45:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2024-10-11 16:45:56,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8656957928802589 [2024-10-11 16:45:56,841 INFO L175 Difference]: Start difference. First operand has 182 places, 179 transitions, 396 flow. Second operand 6 states and 1070 transitions. [2024-10-11 16:45:56,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 182 transitions, 456 flow [2024-10-11 16:45:56,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 182 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:45:56,843 INFO L231 Difference]: Finished difference. Result has 184 places, 0 transitions, 0 flow [2024-10-11 16:45:56,844 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=184, PETRI_TRANSITIONS=0} [2024-10-11 16:45:56,845 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, -10 predicate places. [2024-10-11 16:45:56,846 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 0 transitions, 0 flow [2024-10-11 16:45:56,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:45:56,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2024-10-11 16:45:56,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 24 remaining) [2024-10-11 16:45:56,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2024-10-11 16:45:56,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2024-10-11 16:45:56,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2024-10-11 16:45:56,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2024-10-11 16:45:56,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2024-10-11 16:45:56,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2024-10-11 16:45:56,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2024-10-11 16:45:56,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2024-10-11 16:45:56,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2024-10-11 16:45:56,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2024-10-11 16:45:56,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2024-10-11 16:45:56,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2024-10-11 16:45:56,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2024-10-11 16:45:56,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2024-10-11 16:45:56,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2024-10-11 16:45:56,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2024-10-11 16:45:56,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2024-10-11 16:45:56,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2024-10-11 16:45:56,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2024-10-11 16:45:56,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2024-10-11 16:45:56,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2024-10-11 16:45:56,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2024-10-11 16:45:56,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:45:56,857 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:45:56,862 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 16:45:56,862 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 16:45:56,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 04:45:56 BasicIcfg [2024-10-11 16:45:56,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 16:45:56,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 16:45:56,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 16:45:56,872 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 16:45:56,873 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:45:51" (3/4) ... [2024-10-11 16:45:56,876 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 16:45:56,880 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2024-10-11 16:45:56,880 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2024-10-11 16:45:56,882 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-11 16:45:56,883 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 16:45:56,883 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 16:45:56,883 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 16:45:56,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 16:45:56,976 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 16:45:56,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 16:45:56,977 INFO L158 Benchmark]: Toolchain (without parser) took 6872.93ms. Allocated memory was 174.1MB in the beginning and 455.1MB in the end (delta: 281.0MB). Free memory was 137.2MB in the beginning and 352.5MB in the end (delta: -215.3MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-10-11 16:45:56,979 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 78.4MB in the beginning and 78.2MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 16:45:56,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.37ms. Allocated memory is still 174.1MB. Free memory was 137.2MB in the beginning and 104.7MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 16:45:56,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.51ms. Allocated memory is still 174.1MB. Free memory was 104.7MB in the beginning and 101.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 16:45:56,980 INFO L158 Benchmark]: Boogie Preprocessor took 53.23ms. Allocated memory is still 174.1MB. Free memory was 101.6MB in the beginning and 99.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 16:45:56,980 INFO L158 Benchmark]: RCFGBuilder took 588.75ms. Allocated memory is still 174.1MB. Free memory was 99.5MB in the beginning and 122.6MB in the end (delta: -23.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 16:45:56,981 INFO L158 Benchmark]: TraceAbstraction took 5333.70ms. Allocated memory was 174.1MB in the beginning and 455.1MB in the end (delta: 281.0MB). Free memory was 121.6MB in the beginning and 356.7MB in the end (delta: -235.2MB). Peak memory consumption was 244.0MB. Max. memory is 16.1GB. [2024-10-11 16:45:56,981 INFO L158 Benchmark]: Witness Printer took 104.35ms. Allocated memory is still 455.1MB. Free memory was 356.7MB in the beginning and 352.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 16:45:56,982 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 78.4MB in the beginning and 78.2MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.37ms. Allocated memory is still 174.1MB. Free memory was 137.2MB in the beginning and 104.7MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.51ms. Allocated memory is still 174.1MB. Free memory was 104.7MB in the beginning and 101.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.23ms. Allocated memory is still 174.1MB. Free memory was 101.6MB in the beginning and 99.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 588.75ms. Allocated memory is still 174.1MB. Free memory was 99.5MB in the beginning and 122.6MB in the end (delta: -23.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5333.70ms. Allocated memory was 174.1MB in the beginning and 455.1MB in the end (delta: 281.0MB). Free memory was 121.6MB in the beginning and 356.7MB in the end (delta: -235.2MB). Peak memory consumption was 244.0MB. Max. memory is 16.1GB. * Witness Printer took 104.35ms. Allocated memory is still 455.1MB. Free memory was 356.7MB in the beginning and 352.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 968]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 945]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 945]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1008]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 975]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 983]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 350 locations, 24 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: 5.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 71 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766occurred 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.6s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 16:45:57,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE