./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2d0b9c4fc8b0005fb250fdf1ff8e25835b95e676b1936e4f5fe1cf72245ee5f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:33:16,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:33:16,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:33:16,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:33:16,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:33:16,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:33:16,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:33:16,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:33:16,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:33:16,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:33:16,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:33:16,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:33:16,740 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:33:16,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:33:16,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:33:16,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:33:16,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:33:16,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:33:16,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:33:16,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:33:16,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:33:16,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:33:16,743 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-jdk21/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 -> 2d0b9c4fc8b0005fb250fdf1ff8e25835b95e676b1936e4f5fe1cf72245ee5f5 [2025-02-08 05:33:16,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:33:16,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:33:16,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:33:16,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:33:16,980 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:33:16,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-02-08 05:33:18,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9901c94e/54d1e1728cb94451aea5e95d1ae64923/FLAGbc2fc38a0 [2025-02-08 05:33:18,448 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:33:18,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-02-08 05:33:18,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9901c94e/54d1e1728cb94451aea5e95d1ae64923/FLAGbc2fc38a0 [2025-02-08 05:33:18,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9901c94e/54d1e1728cb94451aea5e95d1ae64923 [2025-02-08 05:33:18,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:33:18,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:33:18,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:33:18,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:33:18,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:33:18,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:33:18" (1/1) ... [2025-02-08 05:33:18,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d3d26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:18, skipping insertion in model container [2025-02-08 05:33:18,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:33:18" (1/1) ... [2025-02-08 05:33:18,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:33:18,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:33:18,938 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:33:18,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:33:19,001 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:33:19,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19 WrapperNode [2025-02-08 05:33:19,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:33:19,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:33:19,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:33:19,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:33:19,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,041 INFO L138 Inliner]: procedures = 163, calls = 55, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 125 [2025-02-08 05:33:19,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:33:19,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:33:19,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:33:19,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:33:19,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:33:19,061 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:33:19,061 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:33:19,061 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:33:19,062 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (1/1) ... [2025-02-08 05:33:19,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:33:19,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:19,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:33:19,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:33:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-02-08 05:33:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-02-08 05:33:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:33:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:33:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:33:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:33:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:33:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:33:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:33:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:33:19,124 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:33:19,220 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:33:19,221 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:33:19,602 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:33:19,603 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:33:19,678 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:33:19,678 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:33:19,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:19 BoogieIcfgContainer [2025-02-08 05:33:19,686 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:33:19,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:33:19,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:33:19,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:33:19,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:33:18" (1/3) ... [2025-02-08 05:33:19,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbed120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:33:19, skipping insertion in model container [2025-02-08 05:33:19,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:19" (2/3) ... [2025-02-08 05:33:19,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbed120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:33:19, skipping insertion in model container [2025-02-08 05:33:19,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:19" (3/3) ... [2025-02-08 05:33:19,697 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2025-02-08 05:33:19,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:33:19,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_27-multiple-protecting2_true.i that has 3 procedures, 208 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-02-08 05:33:19,720 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:33:19,822 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:33:19,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 215 transitions, 444 flow [2025-02-08 05:33:20,019 INFO L124 PetriNetUnfolderBase]: 8/213 cut-off events. [2025-02-08 05:33:20,022 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:33:20,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 8/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2025-02-08 05:33:20,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 215 transitions, 444 flow [2025-02-08 05:33:20,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 208 transitions, 425 flow [2025-02-08 05:33:20,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:20,075 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;@5aca729c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:20,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 05:33:20,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:20,103 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-02-08 05:33:20,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:20,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:20,104 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] [2025-02-08 05:33:20,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:20,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:20,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1900725784, now seen corresponding path program 1 times [2025-02-08 05:33:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833253570] [2025-02-08 05:33:20,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:20,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:20,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:33:20,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:33:20,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:20,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833253570] [2025-02-08 05:33:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833253570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:20,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182426126] [2025-02-08 05:33:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:20,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:20,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:20,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:20,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 215 [2025-02-08 05:33:20,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 208 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-02-08 05:33:20,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:20,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 215 [2025-02-08 05:33:20,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:22,435 INFO L124 PetriNetUnfolderBase]: 4355/15186 cut-off events. [2025-02-08 05:33:22,435 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-08 05:33:22,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22183 conditions, 15186 events. 4355/15186 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 167298 event pairs, 1643 based on Foata normal form. 962/14831 useless extension candidates. Maximal degree in co-relation 22057. Up to 4457 conditions per place. [2025-02-08 05:33:22,521 INFO L140 encePairwiseOnDemand]: 192/215 looper letters, 66 selfloop transitions, 10 changer transitions 0/224 dead transitions. [2025-02-08 05:33:22,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 224 transitions, 615 flow [2025-02-08 05:33:22,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2025-02-08 05:33:22,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8852713178294573 [2025-02-08 05:33:22,532 INFO L175 Difference]: Start difference. First operand has 207 places, 208 transitions, 425 flow. Second operand 3 states and 571 transitions. [2025-02-08 05:33:22,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 224 transitions, 615 flow [2025-02-08 05:33:22,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 224 transitions, 607 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:33:22,542 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 462 flow [2025-02-08 05:33:22,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-02-08 05:33:22,548 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -9 predicate places. [2025-02-08 05:33:22,549 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 462 flow [2025-02-08 05:33:22,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-02-08 05:33:22,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:22,549 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] [2025-02-08 05:33:22,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:33:22,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:22,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash -201240317, now seen corresponding path program 1 times [2025-02-08 05:33:22,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:22,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-02-08 05:33:22,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:22,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:33:22,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:33:22,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:22,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-02-08 05:33:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565017852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:22,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:22,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081204727] [2025-02-08 05:33:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:22,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:22,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:22,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:22,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 215 [2025-02-08 05:33:22,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-02-08 05:33:22,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:22,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 215 [2025-02-08 05:33:22,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:23,911 INFO L124 PetriNetUnfolderBase]: 4773/14933 cut-off events. [2025-02-08 05:33:23,911 INFO L125 PetriNetUnfolderBase]: For 2287/2315 co-relation queries the response was YES. [2025-02-08 05:33:23,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24615 conditions, 14933 events. 4773/14933 cut-off events. For 2287/2315 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 162210 event pairs, 3453 based on Foata normal form. 28/13560 useless extension candidates. Maximal degree in co-relation 24457. Up to 6392 conditions per place. [2025-02-08 05:33:23,987 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 61 selfloop transitions, 8 changer transitions 0/224 dead transitions. [2025-02-08 05:33:23,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 224 transitions, 670 flow [2025-02-08 05:33:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-02-08 05:33:23,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-02-08 05:33:23,990 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 462 flow. Second operand 3 states and 555 transitions. [2025-02-08 05:33:23,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 224 transitions, 670 flow [2025-02-08 05:33:23,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 224 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:23,996 INFO L231 Difference]: Finished difference. Result has 200 places, 205 transitions, 514 flow [2025-02-08 05:33:23,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=200, PETRI_TRANSITIONS=205} [2025-02-08 05:33:23,997 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -7 predicate places. [2025-02-08 05:33:23,997 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 205 transitions, 514 flow [2025-02-08 05:33:23,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-02-08 05:33:23,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:23,998 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] [2025-02-08 05:33:23,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:33:23,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:23,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:23,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1666168170, now seen corresponding path program 1 times [2025-02-08 05:33:23,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525214937] [2025-02-08 05:33:23,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:24,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:33:24,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:33:24,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:24,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:24,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-02-08 05:33:24,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:24,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525214937] [2025-02-08 05:33:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525214937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:24,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:24,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107044968] [2025-02-08 05:33:24,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:24,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:24,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:24,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:24,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:24,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 215 [2025-02-08 05:33:24,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 205 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-02-08 05:33:24,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:24,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 215 [2025-02-08 05:33:24,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:25,734 INFO L124 PetriNetUnfolderBase]: 6874/23203 cut-off events. [2025-02-08 05:33:25,735 INFO L125 PetriNetUnfolderBase]: For 723/765 co-relation queries the response was YES. [2025-02-08 05:33:25,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35958 conditions, 23203 events. 6874/23203 cut-off events. For 723/765 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 278581 event pairs, 2705 based on Foata normal form. 14/21416 useless extension candidates. Maximal degree in co-relation 35833. Up to 5723 conditions per place. [2025-02-08 05:33:25,827 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 59 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2025-02-08 05:33:25,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 232 transitions, 699 flow [2025-02-08 05:33:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-02-08 05:33:25,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682170542635659 [2025-02-08 05:33:25,829 INFO L175 Difference]: Start difference. First operand has 200 places, 205 transitions, 514 flow. Second operand 3 states and 560 transitions. [2025-02-08 05:33:25,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 232 transitions, 699 flow [2025-02-08 05:33:25,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 232 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:25,834 INFO L231 Difference]: Finished difference. Result has 200 places, 207 transitions, 536 flow [2025-02-08 05:33:25,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=200, PETRI_TRANSITIONS=207} [2025-02-08 05:33:25,835 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -7 predicate places. [2025-02-08 05:33:25,836 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 207 transitions, 536 flow [2025-02-08 05:33:25,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-02-08 05:33:25,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:25,836 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] [2025-02-08 05:33:25,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:33:25,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:25,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 76307980, now seen corresponding path program 1 times [2025-02-08 05:33:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:25,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769904843] [2025-02-08 05:33:25,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:25,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:33:25,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:33:25,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:25,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769904843] [2025-02-08 05:33:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769904843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247472673] [2025-02-08 05:33:25,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:25,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:25,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:25,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:25,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:25,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 215 [2025-02-08 05:33:25,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 207 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-02-08 05:33:25,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:25,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 215 [2025-02-08 05:33:25,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:27,999 INFO L124 PetriNetUnfolderBase]: 7722/24365 cut-off events. [2025-02-08 05:33:27,999 INFO L125 PetriNetUnfolderBase]: For 3832/3938 co-relation queries the response was YES. [2025-02-08 05:33:28,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40987 conditions, 24365 events. 7722/24365 cut-off events. For 3832/3938 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 292358 event pairs, 5379 based on Foata normal form. 14/22283 useless extension candidates. Maximal degree in co-relation 40863. Up to 10216 conditions per place. [2025-02-08 05:33:28,094 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 57 selfloop transitions, 4 changer transitions 0/229 dead transitions. [2025-02-08 05:33:28,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 229 transitions, 707 flow [2025-02-08 05:33:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2025-02-08 05:33:28,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635658914728682 [2025-02-08 05:33:28,096 INFO L175 Difference]: Start difference. First operand has 200 places, 207 transitions, 536 flow. Second operand 3 states and 557 transitions. [2025-02-08 05:33:28,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 229 transitions, 707 flow [2025-02-08 05:33:28,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 229 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:28,101 INFO L231 Difference]: Finished difference. Result has 202 places, 210 transitions, 556 flow [2025-02-08 05:33:28,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=202, PETRI_TRANSITIONS=210} [2025-02-08 05:33:28,102 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -5 predicate places. [2025-02-08 05:33:28,102 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 210 transitions, 556 flow [2025-02-08 05:33:28,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-02-08 05:33:28,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:28,102 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-02-08 05:33:28,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:33:28,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1371295469, now seen corresponding path program 1 times [2025-02-08 05:33:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:28,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321100360] [2025-02-08 05:33:28,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:28,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:33:28,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:33:28,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:28,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321100360] [2025-02-08 05:33:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321100360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:28,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154288348] [2025-02-08 05:33:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:28,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:33:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:28,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:33:28,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:33:28,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 215 [2025-02-08 05:33:28,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 210 transitions, 556 flow. Second operand has 5 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 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-02-08 05:33:28,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:28,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 215 [2025-02-08 05:33:28,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:29,110 INFO L124 PetriNetUnfolderBase]: 1980/10595 cut-off events. [2025-02-08 05:33:29,111 INFO L125 PetriNetUnfolderBase]: For 425/498 co-relation queries the response was YES. [2025-02-08 05:33:29,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15886 conditions, 10595 events. 1980/10595 cut-off events. For 425/498 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 124060 event pairs, 608 based on Foata normal form. 109/9924 useless extension candidates. Maximal degree in co-relation 15759. Up to 1748 conditions per place. [2025-02-08 05:33:29,154 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 44 selfloop transitions, 8 changer transitions 0/233 dead transitions. [2025-02-08 05:33:29,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 233 transitions, 708 flow [2025-02-08 05:33:29,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:33:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:33:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2025-02-08 05:33:29,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8548837209302326 [2025-02-08 05:33:29,157 INFO L175 Difference]: Start difference. First operand has 202 places, 210 transitions, 556 flow. Second operand 5 states and 919 transitions. [2025-02-08 05:33:29,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 233 transitions, 708 flow [2025-02-08 05:33:29,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 233 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:29,161 INFO L231 Difference]: Finished difference. Result has 205 places, 214 transitions, 586 flow [2025-02-08 05:33:29,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=586, PETRI_PLACES=205, PETRI_TRANSITIONS=214} [2025-02-08 05:33:29,162 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -2 predicate places. [2025-02-08 05:33:29,162 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 214 transitions, 586 flow [2025-02-08 05:33:29,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 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-02-08 05:33:29,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:29,163 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-02-08 05:33:29,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:33:29,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:29,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash -790897853, now seen corresponding path program 1 times [2025-02-08 05:33:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122201538] [2025-02-08 05:33:29,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:29,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:33:29,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:33:29,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:29,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:29,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122201538] [2025-02-08 05:33:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122201538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:29,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595825607] [2025-02-08 05:33:29,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:29,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:29,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:29,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:29,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:29,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 215 [2025-02-08 05:33:29,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 214 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:29,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:29,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 215 [2025-02-08 05:33:29,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:30,438 INFO L124 PetriNetUnfolderBase]: 3946/14426 cut-off events. [2025-02-08 05:33:30,438 INFO L125 PetriNetUnfolderBase]: For 3501/3511 co-relation queries the response was YES. [2025-02-08 05:33:30,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26551 conditions, 14426 events. 3946/14426 cut-off events. For 3501/3511 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 165772 event pairs, 2498 based on Foata normal form. 2/13442 useless extension candidates. Maximal degree in co-relation 26386. Up to 6071 conditions per place. [2025-02-08 05:33:30,516 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 70 selfloop transitions, 8 changer transitions 2/242 dead transitions. [2025-02-08 05:33:30,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 242 transitions, 840 flow [2025-02-08 05:33:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-02-08 05:33:30,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-02-08 05:33:30,520 INFO L175 Difference]: Start difference. First operand has 205 places, 214 transitions, 586 flow. Second operand 3 states and 555 transitions. [2025-02-08 05:33:30,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 242 transitions, 840 flow [2025-02-08 05:33:30,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 242 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:30,525 INFO L231 Difference]: Finished difference. Result has 207 places, 221 transitions, 665 flow [2025-02-08 05:33:30,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=665, PETRI_PLACES=207, PETRI_TRANSITIONS=221} [2025-02-08 05:33:30,526 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2025-02-08 05:33:30,526 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 221 transitions, 665 flow [2025-02-08 05:33:30,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:30,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:30,526 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] [2025-02-08 05:33:30,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:33:30,527 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1392652171, now seen corresponding path program 1 times [2025-02-08 05:33:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351345417] [2025-02-08 05:33:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:30,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:33:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:33:30,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:30,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351345417] [2025-02-08 05:33:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351345417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:30,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778622264] [2025-02-08 05:33:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:30,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:30,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:30,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:30,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 215 [2025-02-08 05:33:30,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 221 transitions, 665 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-02-08 05:33:30,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:30,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 215 [2025-02-08 05:33:30,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:31,886 INFO L124 PetriNetUnfolderBase]: 3679/15023 cut-off events. [2025-02-08 05:33:31,887 INFO L125 PetriNetUnfolderBase]: For 3682/3804 co-relation queries the response was YES. [2025-02-08 05:33:31,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27279 conditions, 15023 events. 3679/15023 cut-off events. For 3682/3804 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 176782 event pairs, 2162 based on Foata normal form. 4/13779 useless extension candidates. Maximal degree in co-relation 27144. Up to 5227 conditions per place. [2025-02-08 05:33:31,967 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 61 selfloop transitions, 4 changer transitions 3/245 dead transitions. [2025-02-08 05:33:31,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 245 transitions, 873 flow [2025-02-08 05:33:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2025-02-08 05:33:31,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635658914728682 [2025-02-08 05:33:31,969 INFO L175 Difference]: Start difference. First operand has 207 places, 221 transitions, 665 flow. Second operand 3 states and 557 transitions. [2025-02-08 05:33:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 245 transitions, 873 flow [2025-02-08 05:33:31,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 245 transitions, 847 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:31,982 INFO L231 Difference]: Finished difference. Result has 209 places, 224 transitions, 673 flow [2025-02-08 05:33:31,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=209, PETRI_TRANSITIONS=224} [2025-02-08 05:33:31,983 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 2 predicate places. [2025-02-08 05:33:31,983 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 224 transitions, 673 flow [2025-02-08 05:33:31,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-02-08 05:33:31,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:31,984 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] [2025-02-08 05:33:31,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:33:31,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:31,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -834832866, now seen corresponding path program 1 times [2025-02-08 05:33:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-02-08 05:33:31,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:32,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:33:32,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:33:32,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:32,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-02-08 05:33:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74735963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625326289] [2025-02-08 05:33:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:32,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:33:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:32,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:33:32,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:33:32,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 215 [2025-02-08 05:33:32,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 224 transitions, 673 flow. Second operand has 5 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 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-02-08 05:33:32,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:32,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 215 [2025-02-08 05:33:32,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:32,887 INFO L124 PetriNetUnfolderBase]: 1334/7791 cut-off events. [2025-02-08 05:33:32,888 INFO L125 PetriNetUnfolderBase]: For 1539/1576 co-relation queries the response was YES. [2025-02-08 05:33:32,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13295 conditions, 7791 events. 1334/7791 cut-off events. For 1539/1576 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 86357 event pairs, 369 based on Foata normal form. 22/7400 useless extension candidates. Maximal degree in co-relation 13159. Up to 1344 conditions per place. [2025-02-08 05:33:32,920 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 40 selfloop transitions, 10 changer transitions 13/250 dead transitions. [2025-02-08 05:33:32,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 250 transitions, 867 flow [2025-02-08 05:33:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:33:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:33:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2025-02-08 05:33:32,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8548837209302326 [2025-02-08 05:33:32,923 INFO L175 Difference]: Start difference. First operand has 209 places, 224 transitions, 673 flow. Second operand 5 states and 919 transitions. [2025-02-08 05:33:32,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 250 transitions, 867 flow [2025-02-08 05:33:32,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 250 transitions, 857 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:32,931 INFO L231 Difference]: Finished difference. Result has 212 places, 223 transitions, 699 flow [2025-02-08 05:33:32,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=699, PETRI_PLACES=212, PETRI_TRANSITIONS=223} [2025-02-08 05:33:32,931 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 5 predicate places. [2025-02-08 05:33:32,932 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 223 transitions, 699 flow [2025-02-08 05:33:32,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 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-02-08 05:33:32,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:32,932 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] [2025-02-08 05:33:32,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:33:32,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:32,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -419360520, now seen corresponding path program 1 times [2025-02-08 05:33:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476802955] [2025-02-08 05:33:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:32,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:33:32,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:33:32,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:32,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476802955] [2025-02-08 05:33:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476802955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:33,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:33,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688502289] [2025-02-08 05:33:33,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:33:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:33,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:33:33,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:33:33,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 215 [2025-02-08 05:33:33,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 223 transitions, 699 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 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-02-08 05:33:33,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:33,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 215 [2025-02-08 05:33:33,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:33,474 INFO L124 PetriNetUnfolderBase]: 557/5593 cut-off events. [2025-02-08 05:33:33,475 INFO L125 PetriNetUnfolderBase]: For 1815/1824 co-relation queries the response was YES. [2025-02-08 05:33:33,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9759 conditions, 5593 events. 557/5593 cut-off events. For 1815/1824 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 57123 event pairs, 210 based on Foata normal form. 164/5611 useless extension candidates. Maximal degree in co-relation 5981. Up to 896 conditions per place. [2025-02-08 05:33:33,492 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 13 selfloop transitions, 19 changer transitions 32/225 dead transitions. [2025-02-08 05:33:33,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 225 transitions, 825 flow [2025-02-08 05:33:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:33:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:33:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 920 transitions. [2025-02-08 05:33:33,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558139534883721 [2025-02-08 05:33:33,498 INFO L175 Difference]: Start difference. First operand has 212 places, 223 transitions, 699 flow. Second operand 5 states and 920 transitions. [2025-02-08 05:33:33,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 225 transitions, 825 flow [2025-02-08 05:33:33,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 225 transitions, 784 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-02-08 05:33:33,506 INFO L231 Difference]: Finished difference. Result has 206 places, 190 transitions, 543 flow [2025-02-08 05:33:33,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=543, PETRI_PLACES=206, PETRI_TRANSITIONS=190} [2025-02-08 05:33:33,507 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -1 predicate places. [2025-02-08 05:33:33,507 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 190 transitions, 543 flow [2025-02-08 05:33:33,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 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-02-08 05:33:33,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:33,508 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] [2025-02-08 05:33:33,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:33:33,508 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2_funErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr3ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:33:33,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1279480564, now seen corresponding path program 1 times [2025-02-08 05:33:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293880675] [2025-02-08 05:33:33,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:33,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:33:33,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:33:33,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:33,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293880675] [2025-02-08 05:33:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293880675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:33,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:33:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551515095] [2025-02-08 05:33:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:33,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:33,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:33,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:33,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 215 [2025-02-08 05:33:33,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 190 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 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-02-08 05:33:33,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:33,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 215 [2025-02-08 05:33:33,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:33,948 INFO L124 PetriNetUnfolderBase]: 84/1224 cut-off events. [2025-02-08 05:33:33,949 INFO L125 PetriNetUnfolderBase]: For 640/647 co-relation queries the response was YES. [2025-02-08 05:33:33,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 1224 events. 84/1224 cut-off events. For 640/647 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7174 event pairs, 40 based on Foata normal form. 2/1189 useless extension candidates. Maximal degree in co-relation 1478. Up to 156 conditions per place. [2025-02-08 05:33:33,951 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 0 selfloop transitions, 0 changer transitions 191/191 dead transitions. [2025-02-08 05:33:33,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 191 transitions, 638 flow [2025-02-08 05:33:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:33:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:33:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 905 transitions. [2025-02-08 05:33:33,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418604651162791 [2025-02-08 05:33:33,956 INFO L175 Difference]: Start difference. First operand has 206 places, 190 transitions, 543 flow. Second operand 5 states and 905 transitions. [2025-02-08 05:33:33,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 191 transitions, 638 flow [2025-02-08 05:33:33,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 191 transitions, 608 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-02-08 05:33:33,962 INFO L231 Difference]: Finished difference. Result has 199 places, 0 transitions, 0 flow [2025-02-08 05:33:33,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=199, PETRI_TRANSITIONS=0} [2025-02-08 05:33:33,962 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -8 predicate places. [2025-02-08 05:33:33,962 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 0 transitions, 0 flow [2025-02-08 05:33:33,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 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-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 22 remaining) [2025-02-08 05:33:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-08 05:33:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-08 05:33:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-08 05:33:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-08 05:33:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-08 05:33:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-08 05:33:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-08 05:33:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-08 05:33:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-08 05:33:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-08 05:33:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-08 05:33:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-08 05:33:33,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:33:33,968 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:33,972 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:33:33,972 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:33:33,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:33:33 BasicIcfg [2025-02-08 05:33:33,977 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:33:33,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:33:33,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:33:33,977 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:33:33,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:19" (3/4) ... [2025-02-08 05:33:33,979 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:33:33,981 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-02-08 05:33:33,981 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 05:33:33,985 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 05:33:33,985 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:33:33,985 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:33:33,985 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:33:34,042 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:33:34,043 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:33:34,043 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:33:34,043 INFO L158 Benchmark]: Toolchain (without parser) took 15367.50ms. Allocated memory was 167.8MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 122.3MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 897.2MB. Max. memory is 16.1GB. [2025-02-08 05:33:34,044 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:33:34,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.89ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 101.6MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:33:34,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.04ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 99.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:33:34,045 INFO L158 Benchmark]: Boogie Preprocessor took 17.05ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 98.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:33:34,045 INFO L158 Benchmark]: IcfgBuilder took 625.20ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 73.8MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:33:34,045 INFO L158 Benchmark]: TraceAbstraction took 14288.83ms. Allocated memory was 167.8MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 73.1MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 846.9MB. Max. memory is 16.1GB. [2025-02-08 05:33:34,046 INFO L158 Benchmark]: Witness Printer took 65.67ms. Allocated memory is still 4.4GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:33:34,047 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.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.89ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 101.6MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.04ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 99.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.05ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 98.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 625.20ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 73.8MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14288.83ms. Allocated memory was 167.8MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 73.1MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 846.9MB. Max. memory is 16.1GB. * Witness Printer took 65.67ms. Allocated memory is still 4.4GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 714]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 721]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 725]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 688]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 688]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 286 locations, 22 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: 14.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 774 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 536 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1132 IncrementalHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 44 mSDtfsCounter, 1132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=699occurred in iteration=8, 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, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 678 ConstructedInterpolants, 0 QuantifiedInterpolants, 1576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:33:34,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE