./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:51:51,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:51:51,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:51:51,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:51:51,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:51:51,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:51:51,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:51:51,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:51:51,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:51:51,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:51:51,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:51:51,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:51:51,590 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:51:51,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:51:51,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:51:51,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:51:51,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:51:51,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:51:51,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:51:51,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:51:51,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:51:51,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:51:51,591 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:51:51,591 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:51:51,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:51:51,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:51:51,592 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:51:51,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:51:51,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:51:51,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:51:51,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:51:51,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:51,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:51:51,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:51:51,593 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 [2025-03-04 06:51:51,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:51:51,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:51:51,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:51:51,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:51:51,826 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:51:51,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-04 06:51:52,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec62b0bad/4a17fdf968a74553ae615572b25fd53f/FLAG4f968e77d [2025-03-04 06:51:53,227 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:51:53,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-04 06:51:53,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec62b0bad/4a17fdf968a74553ae615572b25fd53f/FLAG4f968e77d [2025-03-04 06:51:53,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec62b0bad/4a17fdf968a74553ae615572b25fd53f [2025-03-04 06:51:53,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:51:53,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:51:53,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:53,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:51:53,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:51:53,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364b4bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53, skipping insertion in model container [2025-03-04 06:51:53,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:51:53,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:53,763 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:51:53,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:53,846 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:51:53,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53 WrapperNode [2025-03-04 06:51:53,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:53,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:53,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:51:53,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:51:53,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,886 INFO L138 Inliner]: procedures = 165, calls = 47, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 198 [2025-03-04 06:51:53,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:53,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:51:53,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:51:53,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:51:53,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:51:53,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:51:53,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:51:53,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:51:53,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (1/1) ... [2025-03-04 06:51:53,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:53,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:53,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:51:53,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:51:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:51:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:51:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:51:53,968 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:51:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:51:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:51:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:51:53,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:51:53,970 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:51:54,084 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:51:54,085 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:51:54,322 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:51:54,323 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:51:54,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:51:54,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:51:54,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:54 BoogieIcfgContainer [2025-03-04 06:51:54,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:51:54,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:51:54,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:51:54,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:51:54,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:51:53" (1/3) ... [2025-03-04 06:51:54,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb156fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:54, skipping insertion in model container [2025-03-04 06:51:54,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:53" (2/3) ... [2025-03-04 06:51:54,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb156fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:54, skipping insertion in model container [2025-03-04 06:51:54,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:54" (3/3) ... [2025-03-04 06:51:54,357 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-04 06:51:54,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:51:54,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 226 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-03-04 06:51:54,371 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:51:54,430 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:51:54,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 478 flow [2025-03-04 06:51:54,534 INFO L124 PetriNetUnfolderBase]: 11/240 cut-off events. [2025-03-04 06:51:54,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:51:54,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 240 events. 11/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 193. Up to 2 conditions per place. [2025-03-04 06:51:54,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 237 transitions, 478 flow [2025-03-04 06:51:54,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 235 transitions, 473 flow [2025-03-04 06:51:54,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:51:54,567 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;@1616680a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:51:54,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 06:51:54,581 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:51:54,583 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2025-03-04 06:51:54,583 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:51:54,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:54,584 INFO L206 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] [2025-03-04 06:51:54,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:54,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash 95577846, now seen corresponding path program 1 times [2025-03-04 06:51:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:54,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131848713] [2025-03-04 06:51:54,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:51:54,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:51:54,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:54,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131848713] [2025-03-04 06:51:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131848713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:54,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:54,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398148721] [2025-03-04 06:51:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:54,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:54,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:54,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:54,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 237 [2025-03-04 06:51:54,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 235 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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) [2025-03-04 06:51:54,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:54,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 237 [2025-03-04 06:51:54,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:55,159 INFO L124 PetriNetUnfolderBase]: 122/1316 cut-off events. [2025-03-04 06:51:55,160 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:51:55,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 1316 events. 122/1316 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7828 event pairs, 87 based on Foata normal form. 112/1278 useless extension candidates. Maximal degree in co-relation 1541. Up to 236 conditions per place. [2025-03-04 06:51:55,172 INFO L140 encePairwiseOnDemand]: 221/237 looper letters, 30 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2025-03-04 06:51:55,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 229 transitions, 531 flow [2025-03-04 06:51:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2025-03-04 06:51:55,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2025-03-04 06:51:55,188 INFO L175 Difference]: Start difference. First operand has 228 places, 235 transitions, 473 flow. Second operand 3 states and 651 transitions. [2025-03-04 06:51:55,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 229 transitions, 531 flow [2025-03-04 06:51:55,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 229 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:55,199 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 478 flow [2025-03-04 06:51:55,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=225, PETRI_TRANSITIONS=223} [2025-03-04 06:51:55,205 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2025-03-04 06:51:55,205 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 478 flow [2025-03-04 06:51:55,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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) [2025-03-04 06:51:55,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:55,205 INFO L206 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] [2025-03-04 06:51:55,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:51:55,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:55,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2088200025, now seen corresponding path program 1 times [2025-03-04 06:51:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282772878] [2025-03-04 06:51:55,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:55,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:51:55,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:51:55,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:55,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:55,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282772878] [2025-03-04 06:51:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282772878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:55,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:55,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:55,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997702748] [2025-03-04 06:51:55,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:55,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:55,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:55,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:55,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 237 [2025-03-04 06:51:55,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 223 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2025-03-04 06:51:55,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:55,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 237 [2025-03-04 06:51:55,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:55,484 INFO L124 PetriNetUnfolderBase]: 113/1198 cut-off events. [2025-03-04 06:51:55,484 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:51:55,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1198 events. 113/1198 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7005 event pairs, 84 based on Foata normal form. 0/1093 useless extension candidates. Maximal degree in co-relation 1488. Up to 221 conditions per place. [2025-03-04 06:51:55,488 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 28 selfloop transitions, 4 changer transitions 0/232 dead transitions. [2025-03-04 06:51:55,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 232 transitions, 560 flow [2025-03-04 06:51:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-04 06:51:55,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8945147679324894 [2025-03-04 06:51:55,491 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 478 flow. Second operand 3 states and 636 transitions. [2025-03-04 06:51:55,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 232 transitions, 560 flow [2025-03-04 06:51:55,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 232 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:55,495 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 498 flow [2025-03-04 06:51:55,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2025-03-04 06:51:55,495 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-03-04 06:51:55,496 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 498 flow [2025-03-04 06:51:55,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2025-03-04 06:51:55,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:55,496 INFO L206 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] [2025-03-04 06:51:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:51:55,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 367565723, now seen corresponding path program 1 times [2025-03-04 06:51:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738383908] [2025-03-04 06:51:55,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:55,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:51:55,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:51:55,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:55,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:55,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:55,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738383908] [2025-03-04 06:51:55,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738383908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:55,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:55,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:55,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788589667] [2025-03-04 06:51:55,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:55,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:55,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:55,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:55,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:55,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 237 [2025-03-04 06:51:55,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 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) [2025-03-04 06:51:55,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:55,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 237 [2025-03-04 06:51:55,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:55,813 INFO L124 PetriNetUnfolderBase]: 122/2008 cut-off events. [2025-03-04 06:51:55,813 INFO L125 PetriNetUnfolderBase]: For 46/49 co-relation queries the response was YES. [2025-03-04 06:51:55,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 2008 events. 122/2008 cut-off events. For 46/49 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14304 event pairs, 26 based on Foata normal form. 0/1814 useless extension candidates. Maximal degree in co-relation 2381. Up to 146 conditions per place. [2025-03-04 06:51:55,820 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 30 selfloop transitions, 4 changer transitions 0/240 dead transitions. [2025-03-04 06:51:55,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 240 transitions, 598 flow [2025-03-04 06:51:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2025-03-04 06:51:55,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9127988748241913 [2025-03-04 06:51:55,822 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 498 flow. Second operand 3 states and 649 transitions. [2025-03-04 06:51:55,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 240 transitions, 598 flow [2025-03-04 06:51:55,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 240 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:55,829 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 518 flow [2025-03-04 06:51:55,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2025-03-04 06:51:55,831 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2025-03-04 06:51:55,831 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 518 flow [2025-03-04 06:51:55,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 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) [2025-03-04 06:51:55,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:55,832 INFO L206 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] [2025-03-04 06:51:55,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:51:55,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:55,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2015629549, now seen corresponding path program 1 times [2025-03-04 06:51:55,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:55,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937226608] [2025-03-04 06:51:55,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:55,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:55,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:51:55,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:51:55,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:55,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:55,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:55,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937226608] [2025-03-04 06:51:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937226608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:55,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:55,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:55,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418591278] [2025-03-04 06:51:55,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:55,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:55,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:55,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 237 [2025-03-04 06:51:55,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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) [2025-03-04 06:51:55,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:55,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 237 [2025-03-04 06:51:55,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:56,166 INFO L124 PetriNetUnfolderBase]: 240/3005 cut-off events. [2025-03-04 06:51:56,166 INFO L125 PetriNetUnfolderBase]: For 25/28 co-relation queries the response was YES. [2025-03-04 06:51:56,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 3005 events. 240/3005 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 24985 event pairs, 34 based on Foata normal form. 0/2707 useless extension candidates. Maximal degree in co-relation 3641. Up to 299 conditions per place. [2025-03-04 06:51:56,178 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 31 selfloop transitions, 4 changer transitions 0/243 dead transitions. [2025-03-04 06:51:56,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 243 transitions, 618 flow [2025-03-04 06:51:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-03-04 06:51:56,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113924050632911 [2025-03-04 06:51:56,181 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 518 flow. Second operand 3 states and 648 transitions. [2025-03-04 06:51:56,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 243 transitions, 618 flow [2025-03-04 06:51:56,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 243 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:56,188 INFO L231 Difference]: Finished difference. Result has 231 places, 231 transitions, 540 flow [2025-03-04 06:51:56,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=231, PETRI_TRANSITIONS=231} [2025-03-04 06:51:56,189 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 3 predicate places. [2025-03-04 06:51:56,189 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 231 transitions, 540 flow [2025-03-04 06:51:56,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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) [2025-03-04 06:51:56,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:56,190 INFO L206 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] [2025-03-04 06:51:56,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:51:56,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:56,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1449171681, now seen corresponding path program 1 times [2025-03-04 06:51:56,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:56,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776429808] [2025-03-04 06:51:56,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:56,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:51:56,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:51:56,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:56,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:56,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776429808] [2025-03-04 06:51:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776429808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:51:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711887638] [2025-03-04 06:51:56,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:56,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:56,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:56,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:56,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 237 [2025-03-04 06:51:56,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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) [2025-03-04 06:51:56,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:56,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 237 [2025-03-04 06:51:56,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:56,630 INFO L124 PetriNetUnfolderBase]: 40/1040 cut-off events. [2025-03-04 06:51:56,630 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 06:51:56,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 1040 events. 40/1040 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5010 event pairs, 23 based on Foata normal form. 8/973 useless extension candidates. Maximal degree in co-relation 1218. Up to 82 conditions per place. [2025-03-04 06:51:56,633 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 17 selfloop transitions, 10 changer transitions 1/229 dead transitions. [2025-03-04 06:51:56,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 562 flow [2025-03-04 06:51:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:51:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:51:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1066 transitions. [2025-03-04 06:51:56,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8995780590717299 [2025-03-04 06:51:56,637 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 540 flow. Second operand 5 states and 1066 transitions. [2025-03-04 06:51:56,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 562 flow [2025-03-04 06:51:56,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 229 transitions, 532 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 06:51:56,643 INFO L231 Difference]: Finished difference. Result has 226 places, 222 transitions, 498 flow [2025-03-04 06:51:56,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=498, PETRI_PLACES=226, PETRI_TRANSITIONS=222} [2025-03-04 06:51:56,644 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2025-03-04 06:51:56,646 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 222 transitions, 498 flow [2025-03-04 06:51:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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) [2025-03-04 06:51:56,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:56,646 INFO L206 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] [2025-03-04 06:51:56,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:51:56,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:56,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash 188639647, now seen corresponding path program 1 times [2025-03-04 06:51:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:56,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610150898] [2025-03-04 06:51:56,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:56,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:56,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:51:56,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:51:56,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:56,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610150898] [2025-03-04 06:51:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610150898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:56,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:56,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400910856] [2025-03-04 06:51:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:56,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:56,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:56,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:56,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:56,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 237 [2025-03-04 06:51:56,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 222 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 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) [2025-03-04 06:51:56,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:56,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 237 [2025-03-04 06:51:56,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:56,829 INFO L124 PetriNetUnfolderBase]: 66/1216 cut-off events. [2025-03-04 06:51:56,830 INFO L125 PetriNetUnfolderBase]: For 104/106 co-relation queries the response was YES. [2025-03-04 06:51:56,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1216 events. 66/1216 cut-off events. For 104/106 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6827 event pairs, 59 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 1518. Up to 189 conditions per place. [2025-03-04 06:51:56,833 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 28 selfloop transitions, 3 changer transitions 0/223 dead transitions. [2025-03-04 06:51:56,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 565 flow [2025-03-04 06:51:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-03-04 06:51:56,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8804500703234881 [2025-03-04 06:51:56,836 INFO L175 Difference]: Start difference. First operand has 226 places, 222 transitions, 498 flow. Second operand 3 states and 626 transitions. [2025-03-04 06:51:56,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 565 flow [2025-03-04 06:51:56,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 223 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:56,839 INFO L231 Difference]: Finished difference. Result has 225 places, 221 transitions, 499 flow [2025-03-04 06:51:56,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=225, PETRI_TRANSITIONS=221} [2025-03-04 06:51:56,841 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2025-03-04 06:51:56,842 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 221 transitions, 499 flow [2025-03-04 06:51:56,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 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) [2025-03-04 06:51:56,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:56,842 INFO L206 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] [2025-03-04 06:51:56,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:51:56,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:56,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1021020146, now seen corresponding path program 1 times [2025-03-04 06:51:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:56,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144797966] [2025-03-04 06:51:56,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:56,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:56,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:51:56,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:51:56,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:56,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144797966] [2025-03-04 06:51:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144797966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44917221] [2025-03-04 06:51:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:56,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:56,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:56,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 237 [2025-03-04 06:51:56,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 221 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2025-03-04 06:51:56,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:56,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 237 [2025-03-04 06:51:56,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:57,018 INFO L124 PetriNetUnfolderBase]: 69/1218 cut-off events. [2025-03-04 06:51:57,019 INFO L125 PetriNetUnfolderBase]: For 114/118 co-relation queries the response was YES. [2025-03-04 06:51:57,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1600 conditions, 1218 events. 69/1218 cut-off events. For 114/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6821 event pairs, 60 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1547. Up to 193 conditions per place. [2025-03-04 06:51:57,022 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 28 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-03-04 06:51:57,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 566 flow [2025-03-04 06:51:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-03-04 06:51:57,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8804500703234881 [2025-03-04 06:51:57,024 INFO L175 Difference]: Start difference. First operand has 225 places, 221 transitions, 499 flow. Second operand 3 states and 626 transitions. [2025-03-04 06:51:57,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 566 flow [2025-03-04 06:51:57,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:57,027 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 497 flow [2025-03-04 06:51:57,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2025-03-04 06:51:57,028 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -4 predicate places. [2025-03-04 06:51:57,029 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 497 flow [2025-03-04 06:51:57,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2025-03-04 06:51:57,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:57,029 INFO L206 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] [2025-03-04 06:51:57,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:51:57,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:57,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2144097140, now seen corresponding path program 1 times [2025-03-04 06:51:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:57,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7738547] [2025-03-04 06:51:57,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:57,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 06:51:57,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 06:51:57,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:57,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7738547] [2025-03-04 06:51:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7738547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:57,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:57,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096761631] [2025-03-04 06:51:57,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:57,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:57,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:57,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:57,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 237 [2025-03-04 06:51:57,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2025-03-04 06:51:57,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:57,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 237 [2025-03-04 06:51:57,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:57,233 INFO L124 PetriNetUnfolderBase]: 112/1285 cut-off events. [2025-03-04 06:51:57,234 INFO L125 PetriNetUnfolderBase]: For 116/123 co-relation queries the response was YES. [2025-03-04 06:51:57,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 1285 events. 112/1285 cut-off events. For 116/123 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7216 event pairs, 82 based on Foata normal form. 0/1182 useless extension candidates. Maximal degree in co-relation 1717. Up to 254 conditions per place. [2025-03-04 06:51:57,238 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 29 selfloop transitions, 5 changer transitions 9/230 dead transitions. [2025-03-04 06:51:57,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 230 transitions, 603 flow [2025-03-04 06:51:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-03-04 06:51:57,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890295358649789 [2025-03-04 06:51:57,244 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 497 flow. Second operand 3 states and 633 transitions. [2025-03-04 06:51:57,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 230 transitions, 603 flow [2025-03-04 06:51:57,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 230 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:57,247 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 502 flow [2025-03-04 06:51:57,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2025-03-04 06:51:57,248 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2025-03-04 06:51:57,248 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 502 flow [2025-03-04 06:51:57,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2025-03-04 06:51:57,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:57,249 INFO L206 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] [2025-03-04 06:51:57,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:51:57,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:57,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1692200893, now seen corresponding path program 1 times [2025-03-04 06:51:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:57,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536444297] [2025-03-04 06:51:57,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:57,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:57,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:51:57,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:51:57,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:57,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:57,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536444297] [2025-03-04 06:51:57,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536444297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:57,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:57,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321134308] [2025-03-04 06:51:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:57,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:57,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:57,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:57,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:57,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 237 [2025-03-04 06:51:57,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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) [2025-03-04 06:51:57,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:57,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 237 [2025-03-04 06:51:57,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:57,438 INFO L124 PetriNetUnfolderBase]: 73/1011 cut-off events. [2025-03-04 06:51:57,438 INFO L125 PetriNetUnfolderBase]: For 111/114 co-relation queries the response was YES. [2025-03-04 06:51:57,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1011 events. 73/1011 cut-off events. For 111/114 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4905 event pairs, 52 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1366. Up to 172 conditions per place. [2025-03-04 06:51:57,441 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 28 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2025-03-04 06:51:57,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 224 transitions, 589 flow [2025-03-04 06:51:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 634 transitions. [2025-03-04 06:51:57,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8917018284106891 [2025-03-04 06:51:57,443 INFO L175 Difference]: Start difference. First operand has 226 places, 217 transitions, 502 flow. Second operand 3 states and 634 transitions. [2025-03-04 06:51:57,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 224 transitions, 589 flow [2025-03-04 06:51:57,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 224 transitions, 575 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:57,447 INFO L231 Difference]: Finished difference. Result has 228 places, 220 transitions, 526 flow [2025-03-04 06:51:57,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=228, PETRI_TRANSITIONS=220} [2025-03-04 06:51:57,448 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 0 predicate places. [2025-03-04 06:51:57,448 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 220 transitions, 526 flow [2025-03-04 06:51:57,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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) [2025-03-04 06:51:57,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:57,449 INFO L206 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] [2025-03-04 06:51:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:51:57,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:57,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -901093121, now seen corresponding path program 1 times [2025-03-04 06:51:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953842585] [2025-03-04 06:51:57,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:57,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 06:51:57,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 06:51:57,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:57,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:57,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:57,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953842585] [2025-03-04 06:51:57,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953842585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:57,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:57,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:51:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018478316] [2025-03-04 06:51:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:57,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:57,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:57,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 237 [2025-03-04 06:51:57,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 220 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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) [2025-03-04 06:51:57,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:57,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 237 [2025-03-04 06:51:57,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:57,600 INFO L124 PetriNetUnfolderBase]: 63/1035 cut-off events. [2025-03-04 06:51:57,600 INFO L125 PetriNetUnfolderBase]: For 198/203 co-relation queries the response was YES. [2025-03-04 06:51:57,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1035 events. 63/1035 cut-off events. For 198/203 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5103 event pairs, 30 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1418. Up to 110 conditions per place. [2025-03-04 06:51:57,603 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 24 selfloop transitions, 3 changer transitions 12/232 dead transitions. [2025-03-04 06:51:57,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 232 transitions, 644 flow [2025-03-04 06:51:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-03-04 06:51:57,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029535864978903 [2025-03-04 06:51:57,605 INFO L175 Difference]: Start difference. First operand has 228 places, 220 transitions, 526 flow. Second operand 3 states and 642 transitions. [2025-03-04 06:51:57,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 232 transitions, 644 flow [2025-03-04 06:51:57,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 232 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:57,609 INFO L231 Difference]: Finished difference. Result has 230 places, 218 transitions, 530 flow [2025-03-04 06:51:57,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=230, PETRI_TRANSITIONS=218} [2025-03-04 06:51:57,610 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 2 predicate places. [2025-03-04 06:51:57,610 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 218 transitions, 530 flow [2025-03-04 06:51:57,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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) [2025-03-04 06:51:57,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:57,611 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:57,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:51:57,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 06:51:57,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1620383298, now seen corresponding path program 1 times [2025-03-04 06:51:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:57,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190475924] [2025-03-04 06:51:57,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:57,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 06:51:57,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 06:51:57,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:57,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190475924] [2025-03-04 06:51:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190475924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:58,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:51:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472693496] [2025-03-04 06:51:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:58,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:51:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:58,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:51:58,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:51:58,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 237 [2025-03-04 06:51:58,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 218 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 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) [2025-03-04 06:51:58,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:58,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 237 [2025-03-04 06:51:58,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:58,218 INFO L124 PetriNetUnfolderBase]: 16/563 cut-off events. [2025-03-04 06:51:58,218 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-04 06:51:58,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 563 events. 16/563 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1649 event pairs, 2 based on Foata normal form. 6/540 useless extension candidates. Maximal degree in co-relation 681. Up to 45 conditions per place. [2025-03-04 06:51:58,219 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 0 selfloop transitions, 0 changer transitions 209/209 dead transitions. [2025-03-04 06:51:58,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 209 transitions, 543 flow [2025-03-04 06:51:58,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1261 transitions. [2025-03-04 06:51:58,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8867791842475387 [2025-03-04 06:51:58,223 INFO L175 Difference]: Start difference. First operand has 230 places, 218 transitions, 530 flow. Second operand 6 states and 1261 transitions. [2025-03-04 06:51:58,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 209 transitions, 543 flow [2025-03-04 06:51:58,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 209 transitions, 502 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-04 06:51:58,228 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2025-03-04 06:51:58,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2025-03-04 06:51:58,229 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -11 predicate places. [2025-03-04 06:51:58,229 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2025-03-04 06:51:58,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 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) [2025-03-04 06:51:58,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-03-04 06:51:58,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-04 06:51:58,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-04 06:51:58,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-04 06:51:58,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-04 06:51:58,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-03-04 06:51:58,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-04 06:51:58,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-04 06:51:58,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-04 06:51:58,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-04 06:51:58,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-04 06:51:58,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-04 06:51:58,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-04 06:51:58,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-04 06:51:58,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:51:58,233 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:58,237 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:51:58,237 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:51:58,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:51:58 BasicIcfg [2025-03-04 06:51:58,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:51:58,241 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:51:58,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:51:58,241 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:51:58,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:54" (3/4) ... [2025-03-04 06:51:58,242 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:51:58,244 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 06:51:58,246 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 06:51:58,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 06:51:58,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:51:58,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:51:58,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:51:58,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:51:58,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:51:58,299 INFO L158 Benchmark]: Toolchain (without parser) took 4777.67ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 153.3MB in the beginning and 199.6MB in the end (delta: -46.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2025-03-04 06:51:58,299 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:51:58,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.00ms. Allocated memory is still 201.3MB. Free memory was 153.3MB in the beginning and 132.4MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:51:58,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.46ms. Allocated memory is still 201.3MB. Free memory was 132.4MB in the beginning and 130.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:51:58,300 INFO L158 Benchmark]: Boogie Preprocessor took 29.30ms. Allocated memory is still 201.3MB. Free memory was 130.5MB in the beginning and 129.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:51:58,301 INFO L158 Benchmark]: IcfgBuilder took 433.15ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 105.7MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:51:58,301 INFO L158 Benchmark]: TraceAbstraction took 3888.35ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 104.9MB in the beginning and 205.2MB in the end (delta: -100.3MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2025-03-04 06:51:58,301 INFO L158 Benchmark]: Witness Printer took 57.31ms. Allocated memory is still 260.0MB. Free memory was 205.2MB in the beginning and 199.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:51:58,303 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.00ms. Allocated memory is still 201.3MB. Free memory was 153.3MB in the beginning and 132.4MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.46ms. Allocated memory is still 201.3MB. Free memory was 132.4MB in the beginning and 130.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.30ms. Allocated memory is still 201.3MB. Free memory was 130.5MB in the beginning and 129.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 433.15ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 105.7MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3888.35ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 104.9MB in the beginning and 205.2MB in the end (delta: -100.3MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * Witness Printer took 57.31ms. Allocated memory is still 260.0MB. Free memory was 205.2MB in the beginning and 199.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 737]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 738]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 739]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 742]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 746]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 716]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 722]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 723]: 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 3 procedures, 332 locations, 14 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: 3.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 812 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 34 mSDtfsCounter, 812 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 2347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:51:58,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE