./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c --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/weaver/parallel-ticket-3.wvr.c -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 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:27,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:27,720 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:39:27,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:27,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:27,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:27,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:27,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:27,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:27,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:27,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:27,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:27,748 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:27,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:27,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:27,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:27,749 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:27,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:27,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:27,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:27,750 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 -> 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 [2025-02-08 05:39:27,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:28,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:28,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:28,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:28,010 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:28,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-02-08 05:39:29,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43425ad3a/09c59f8ee4334f8a80a1069f75835465/FLAGeea955d5d [2025-02-08 05:39:29,412 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:29,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-02-08 05:39:29,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43425ad3a/09c59f8ee4334f8a80a1069f75835465/FLAGeea955d5d [2025-02-08 05:39:29,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43425ad3a/09c59f8ee4334f8a80a1069f75835465 [2025-02-08 05:39:29,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:29,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:29,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:29,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:29,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:29,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dfd6d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29, skipping insertion in model container [2025-02-08 05:39:29,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:29,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:29,881 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:29,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:29,918 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:29,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29 WrapperNode [2025-02-08 05:39:29,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:29,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:29,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:29,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:29,925 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:39:29" (1/1) ... [2025-02-08 05:39:29,932 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:39:29" (1/1) ... [2025-02-08 05:39:29,950 INFO L138 Inliner]: procedures = 19, calls = 15, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-02-08 05:39:29,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:29,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:29,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:29,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:29,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:29,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:29,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:29,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:29,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (1/1) ... [2025-02-08 05:39:29,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:30,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:30,018 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:39:30,027 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:39:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:30,045 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:30,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:30,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:30,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:30,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:30,047 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:39:30,126 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:30,128 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:30,351 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:30,353 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:30,386 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:30,386 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:30,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:30 BoogieIcfgContainer [2025-02-08 05:39:30,387 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:30,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:30,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:30,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:30,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:29" (1/3) ... [2025-02-08 05:39:30,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9ef05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:30, skipping insertion in model container [2025-02-08 05:39:30,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:29" (2/3) ... [2025-02-08 05:39:30,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9ef05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:30, skipping insertion in model container [2025-02-08 05:39:30,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:30" (3/3) ... [2025-02-08 05:39:30,394 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2025-02-08 05:39:30,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:30,405 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-3.wvr.c that has 4 procedures, 183 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-02-08 05:39:30,405 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:30,464 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:39:30,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 189 transitions, 399 flow [2025-02-08 05:39:30,546 INFO L124 PetriNetUnfolderBase]: 7/186 cut-off events. [2025-02-08 05:39:30,547 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:39:30,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 7/186 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 221 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2025-02-08 05:39:30,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 189 transitions, 399 flow [2025-02-08 05:39:30,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 169 transitions, 353 flow [2025-02-08 05:39:30,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:30,575 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;@6d1350de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:30,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:39:30,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:30,581 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:39:30,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:30,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:30,581 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] [2025-02-08 05:39:30,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:30,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1662509595, now seen corresponding path program 1 times [2025-02-08 05:39:30,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:30,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320823599] [2025-02-08 05:39:30,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:30,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:30,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:39:30,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:39:30,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:30,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:30,700 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:39:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320823599] [2025-02-08 05:39:30,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320823599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:30,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:30,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:30,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767240335] [2025-02-08 05:39:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:30,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:30,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:30,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:30,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:30,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2025-02-08 05:39:30,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:39:30,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:30,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2025-02-08 05:39:30,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,014 INFO L124 PetriNetUnfolderBase]: 261/1148 cut-off events. [2025-02-08 05:39:31,014 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-08 05:39:31,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1148 events. 261/1148 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7978 event pairs, 188 based on Foata normal form. 59/1036 useless extension candidates. Maximal degree in co-relation 1488. Up to 415 conditions per place. [2025-02-08 05:39:31,028 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 24 selfloop transitions, 2 changer transitions 1/164 dead transitions. [2025-02-08 05:39:31,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 164 transitions, 395 flow [2025-02-08 05:39:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2025-02-08 05:39:31,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8694885361552028 [2025-02-08 05:39:31,042 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 353 flow. Second operand 3 states and 493 transitions. [2025-02-08 05:39:31,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 164 transitions, 395 flow [2025-02-08 05:39:31,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 164 transitions, 386 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:31,049 INFO L231 Difference]: Finished difference. Result has 169 places, 163 transitions, 336 flow [2025-02-08 05:39:31,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=169, PETRI_TRANSITIONS=163} [2025-02-08 05:39:31,054 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -4 predicate places. [2025-02-08 05:39:31,054 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 163 transitions, 336 flow [2025-02-08 05:39:31,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:39:31,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,055 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] [2025-02-08 05:39:31,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:31,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:31,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash -974375103, now seen corresponding path program 1 times [2025-02-08 05:39:31,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291916841] [2025-02-08 05:39:31,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:39:31,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:39:31,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,102 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:39:31,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291916841] [2025-02-08 05:39:31,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291916841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6695804] [2025-02-08 05:39:31,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2025-02-08 05:39:31,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 163 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:39:31,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2025-02-08 05:39:31,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,295 INFO L124 PetriNetUnfolderBase]: 301/1039 cut-off events. [2025-02-08 05:39:31,295 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 05:39:31,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 1039 events. 301/1039 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6541 event pairs, 235 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1556. Up to 479 conditions per place. [2025-02-08 05:39:31,304 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 24 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-02-08 05:39:31,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 386 flow [2025-02-08 05:39:31,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2025-02-08 05:39:31,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624338624338624 [2025-02-08 05:39:31,308 INFO L175 Difference]: Start difference. First operand has 169 places, 163 transitions, 336 flow. Second operand 3 states and 489 transitions. [2025-02-08 05:39:31,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 386 flow [2025-02-08 05:39:31,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:31,312 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 334 flow [2025-02-08 05:39:31,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2025-02-08 05:39:31,314 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -6 predicate places. [2025-02-08 05:39:31,314 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 334 flow [2025-02-08 05:39:31,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:39:31,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,315 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] [2025-02-08 05:39:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:31,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1080034071, now seen corresponding path program 1 times [2025-02-08 05:39:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060174602] [2025-02-08 05:39:31,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:39:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:39:31,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,378 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:39:31,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060174602] [2025-02-08 05:39:31,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060174602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218650426] [2025-02-08 05:39:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2025-02-08 05:39:31,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:39:31,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2025-02-08 05:39:31,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,556 INFO L124 PetriNetUnfolderBase]: 275/1133 cut-off events. [2025-02-08 05:39:31,556 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 05:39:31,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 1133 events. 275/1133 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7432 event pairs, 207 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1583. Up to 440 conditions per place. [2025-02-08 05:39:31,564 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 24 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-02-08 05:39:31,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 161 transitions, 384 flow [2025-02-08 05:39:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2025-02-08 05:39:31,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624338624338624 [2025-02-08 05:39:31,567 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 334 flow. Second operand 3 states and 489 transitions. [2025-02-08 05:39:31,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 161 transitions, 384 flow [2025-02-08 05:39:31,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 161 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:31,570 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 332 flow [2025-02-08 05:39:31,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-02-08 05:39:31,572 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -7 predicate places. [2025-02-08 05:39:31,572 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 332 flow [2025-02-08 05:39:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:39:31,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,573 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] [2025-02-08 05:39:31,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:31,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 661346040, now seen corresponding path program 1 times [2025-02-08 05:39:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363965689] [2025-02-08 05:39:31,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:39:31,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:39:31,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,638 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:39:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363965689] [2025-02-08 05:39:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363965689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078524295] [2025-02-08 05:39:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 189 [2025-02-08 05:39:31,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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:39:31,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 189 [2025-02-08 05:39:31,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:31,823 INFO L124 PetriNetUnfolderBase]: 362/1529 cut-off events. [2025-02-08 05:39:31,824 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:39:31,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 1529 events. 362/1529 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11709 event pairs, 161 based on Foata normal form. 0/1312 useless extension candidates. Maximal degree in co-relation 2140. Up to 464 conditions per place. [2025-02-08 05:39:31,830 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 31 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2025-02-08 05:39:31,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 168 transitions, 415 flow [2025-02-08 05:39:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2025-02-08 05:39:31,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8853615520282186 [2025-02-08 05:39:31,832 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 332 flow. Second operand 3 states and 502 transitions. [2025-02-08 05:39:31,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 168 transitions, 415 flow [2025-02-08 05:39:31,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 168 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:31,834 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 330 flow [2025-02-08 05:39:31,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-02-08 05:39:31,835 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -8 predicate places. [2025-02-08 05:39:31,835 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 330 flow [2025-02-08 05:39:31,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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:39:31,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:31,835 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] [2025-02-08 05:39:31,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:31,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:31,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1143855162, now seen corresponding path program 1 times [2025-02-08 05:39:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:31,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182177327] [2025-02-08 05:39:31,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:31,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:39:31,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:39:31,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:31,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:31,909 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:39:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:31,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182177327] [2025-02-08 05:39:31,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182177327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:31,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:31,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747099902] [2025-02-08 05:39:31,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:31,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:31,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:31,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:31,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2025-02-08 05:39:31,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:39:31,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:31,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2025-02-08 05:39:31,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,027 INFO L124 PetriNetUnfolderBase]: 318/1112 cut-off events. [2025-02-08 05:39:32,028 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-08 05:39:32,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 1112 events. 318/1112 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7530 event pairs, 73 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1239. Up to 362 conditions per place. [2025-02-08 05:39:32,035 INFO L140 encePairwiseOnDemand]: 187/189 looper letters, 30 selfloop transitions, 1 changer transitions 0/167 dead transitions. [2025-02-08 05:39:32,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 167 transitions, 409 flow [2025-02-08 05:39:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-02-08 05:39:32,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892416225749559 [2025-02-08 05:39:32,037 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 330 flow. Second operand 3 states and 506 transitions. [2025-02-08 05:39:32,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 167 transitions, 409 flow [2025-02-08 05:39:32,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 167 transitions, 405 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,039 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 326 flow [2025-02-08 05:39:32,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2025-02-08 05:39:32,040 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -9 predicate places. [2025-02-08 05:39:32,040 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 326 flow [2025-02-08 05:39:32,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:39:32,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:32,041 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] [2025-02-08 05:39:32,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:32,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:32,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -105049436, now seen corresponding path program 1 times [2025-02-08 05:39:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183815903] [2025-02-08 05:39:32,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:39:32,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:39:32,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,116 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:39:32,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183815903] [2025-02-08 05:39:32,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183815903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188322150] [2025-02-08 05:39:32,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 189 [2025-02-08 05:39:32,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 326 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:39:32,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 189 [2025-02-08 05:39:32,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,254 INFO L124 PetriNetUnfolderBase]: 456/1243 cut-off events. [2025-02-08 05:39:32,255 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:39:32,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 1243 events. 456/1243 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8085 event pairs, 280 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 1494. Up to 553 conditions per place. [2025-02-08 05:39:32,261 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 32 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-02-08 05:39:32,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 167 transitions, 413 flow [2025-02-08 05:39:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-02-08 05:39:32,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8871252204585538 [2025-02-08 05:39:32,263 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 326 flow. Second operand 3 states and 503 transitions. [2025-02-08 05:39:32,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 167 transitions, 413 flow [2025-02-08 05:39:32,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 167 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:32,265 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 327 flow [2025-02-08 05:39:32,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2025-02-08 05:39:32,269 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -9 predicate places. [2025-02-08 05:39:32,269 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 327 flow [2025-02-08 05:39:32,270 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:39:32,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:32,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:32,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:32,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:32,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash -626125722, now seen corresponding path program 1 times [2025-02-08 05:39:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066923333] [2025-02-08 05:39:32,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:39:32,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:39:32,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,339 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:39:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066923333] [2025-02-08 05:39:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066923333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259782357] [2025-02-08 05:39:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2025-02-08 05:39:32,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:39:32,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2025-02-08 05:39:32,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,489 INFO L124 PetriNetUnfolderBase]: 325/1161 cut-off events. [2025-02-08 05:39:32,489 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-08 05:39:32,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 1161 events. 325/1161 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7448 event pairs, 115 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 1304. Up to 283 conditions per place. [2025-02-08 05:39:32,495 INFO L140 encePairwiseOnDemand]: 187/189 looper letters, 28 selfloop transitions, 1 changer transitions 6/166 dead transitions. [2025-02-08 05:39:32,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 166 transitions, 410 flow [2025-02-08 05:39:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2025-02-08 05:39:32,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8941798941798942 [2025-02-08 05:39:32,496 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 327 flow. Second operand 3 states and 507 transitions. [2025-02-08 05:39:32,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 166 transitions, 410 flow [2025-02-08 05:39:32,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 166 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,499 INFO L231 Difference]: Finished difference. Result has 163 places, 153 transitions, 315 flow [2025-02-08 05:39:32,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=163, PETRI_TRANSITIONS=153} [2025-02-08 05:39:32,500 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -10 predicate places. [2025-02-08 05:39:32,500 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 153 transitions, 315 flow [2025-02-08 05:39:32,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:39:32,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:32,500 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] [2025-02-08 05:39:32,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:32,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:32,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1149530057, now seen corresponding path program 1 times [2025-02-08 05:39:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573696891] [2025-02-08 05:39:32,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:39:32,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:39:32,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,535 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:39:32,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573696891] [2025-02-08 05:39:32,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573696891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730916892] [2025-02-08 05:39:32,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 189 [2025-02-08 05:39:32,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 153 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:32,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 189 [2025-02-08 05:39:32,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,654 INFO L124 PetriNetUnfolderBase]: 335/1263 cut-off events. [2025-02-08 05:39:32,654 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-08 05:39:32,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 1263 events. 335/1263 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8049 event pairs, 187 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1506. Up to 395 conditions per place. [2025-02-08 05:39:32,675 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 31 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-02-08 05:39:32,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 161 transitions, 399 flow [2025-02-08 05:39:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2025-02-08 05:39:32,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8853615520282186 [2025-02-08 05:39:32,676 INFO L175 Difference]: Start difference. First operand has 163 places, 153 transitions, 315 flow. Second operand 3 states and 502 transitions. [2025-02-08 05:39:32,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 161 transitions, 399 flow [2025-02-08 05:39:32,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 161 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:32,678 INFO L231 Difference]: Finished difference. Result has 159 places, 152 transitions, 316 flow [2025-02-08 05:39:32,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=159, PETRI_TRANSITIONS=152} [2025-02-08 05:39:32,679 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -14 predicate places. [2025-02-08 05:39:32,679 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 316 flow [2025-02-08 05:39:32,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:32,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:32,679 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] [2025-02-08 05:39:32,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:32,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:32,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1997160249, now seen corresponding path program 1 times [2025-02-08 05:39:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:32,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156133872] [2025-02-08 05:39:32,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:32,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:39:32,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:39:32,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:32,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:32,708 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:39:32,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156133872] [2025-02-08 05:39:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156133872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824320896] [2025-02-08 05:39:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:32,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:32,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:32,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:32,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2025-02-08 05:39:32,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:39:32,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:32,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2025-02-08 05:39:32,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:32,808 INFO L124 PetriNetUnfolderBase]: 246/1051 cut-off events. [2025-02-08 05:39:32,809 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:39:32,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 1051 events. 246/1051 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6337 event pairs, 112 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1177. Up to 230 conditions per place. [2025-02-08 05:39:32,812 INFO L140 encePairwiseOnDemand]: 187/189 looper letters, 0 selfloop transitions, 0 changer transitions 160/160 dead transitions. [2025-02-08 05:39:32,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 160 transitions, 396 flow [2025-02-08 05:39:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-02-08 05:39:32,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892416225749559 [2025-02-08 05:39:32,813 INFO L175 Difference]: Start difference. First operand has 159 places, 152 transitions, 316 flow. Second operand 3 states and 506 transitions. [2025-02-08 05:39:32,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 160 transitions, 396 flow [2025-02-08 05:39:32,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 160 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:32,815 INFO L231 Difference]: Finished difference. Result has 158 places, 0 transitions, 0 flow [2025-02-08 05:39:32,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=158, PETRI_TRANSITIONS=0} [2025-02-08 05:39:32,815 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, -15 predicate places. [2025-02-08 05:39:32,815 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 0 transitions, 0 flow [2025-02-08 05:39:32,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-08 05:39:32,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-08 05:39:32,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:32,819 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:32,823 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:32,823 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:32,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:32 BasicIcfg [2025-02-08 05:39:32,827 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:32,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:32,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:32,827 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:32,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:30" (3/4) ... [2025-02-08 05:39:32,829 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:32,831 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:32,831 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:32,831 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:32,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 05:39:32,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:32,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:39:32,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:32,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:32,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:32,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:32,886 INFO L158 Benchmark]: Toolchain (without parser) took 3164.35ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 111.6MB in the beginning and 87.7MB in the end (delta: 23.8MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-02-08 05:39:32,887 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:32,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.14ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 99.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:32,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.28ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:32,887 INFO L158 Benchmark]: Boogie Preprocessor took 25.68ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 97.2MB in the end (delta: 881.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:32,887 INFO L158 Benchmark]: IcfgBuilder took 401.93ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 77.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:32,887 INFO L158 Benchmark]: TraceAbstraction took 2438.57ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 77.4MB in the beginning and 92.6MB in the end (delta: -15.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2025-02-08 05:39:32,887 INFO L158 Benchmark]: Witness Printer took 58.87ms. Allocated memory is still 184.5MB. Free memory was 92.6MB in the beginning and 87.7MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:32,888 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.44ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.14ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 99.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.28ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.68ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 97.2MB in the end (delta: 881.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 401.93ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 77.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2438.57ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 77.4MB in the beginning and 92.6MB in the end (delta: -15.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 58.87ms. Allocated memory is still 184.5MB. Free memory was 92.6MB in the beginning and 87.7MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: 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 7 procedures, 264 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 523 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 44 mSDtfsCounter, 523 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:32,905 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