./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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/bench-exp3x3.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 21325645cf7d2c394d0eaa1628a16a96624f1addcdd1b56c7e8aa2473acfaf07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:27:59,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:27:59,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:27:59,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:27:59,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:28:00,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:28:00,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:28:00,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:28:00,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:28:00,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:28:00,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:28:00,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:28:00,003 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:28:00,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:28:00,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:28:00,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:28:00,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:28:00,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:28:00,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:28:00,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:00,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:28:00,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:28:00,006 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 -> 21325645cf7d2c394d0eaa1628a16a96624f1addcdd1b56c7e8aa2473acfaf07 [2025-02-06 09:28:00,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:28:00,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:28:00,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:28:00,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:28:00,226 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:28:00,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2025-02-06 09:28:01,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0b4b6f02/2dd86dc6d60b4a38b154c55e8cadb100/FLAGe659891e1 [2025-02-06 09:28:01,562 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:28:01,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2025-02-06 09:28:01,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0b4b6f02/2dd86dc6d60b4a38b154c55e8cadb100/FLAGe659891e1 [2025-02-06 09:28:01,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0b4b6f02/2dd86dc6d60b4a38b154c55e8cadb100 [2025-02-06 09:28:01,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:28:01,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:28:01,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:28:01,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:28:01,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:28:01,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:28:01" (1/1) ... [2025-02-06 09:28:01,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cefda1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:01, skipping insertion in model container [2025-02-06 09:28:01,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:28:01" (1/1) ... [2025-02-06 09:28:01,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:28:02,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:28:02,042 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:28:02,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:28:02,084 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:28:02,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02 WrapperNode [2025-02-06 09:28:02,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:28:02,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:28:02,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:28:02,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:28:02,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,110 INFO L138 Inliner]: procedures = 21, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 183 [2025-02-06 09:28:02,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:28:02,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:28:02,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:28:02,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:28:02,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:28:02,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:28:02,128 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:28:02,128 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:28:02,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (1/1) ... [2025-02-06 09:28:02,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:02,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:02,158 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-06 09:28:02,160 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-06 09:28:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:28:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:28:02,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:28:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:28:02,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:28:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:28:02,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:28:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 09:28:02,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 09:28:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:28:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-06 09:28:02,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-06 09:28:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-02-06 09:28:02,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-02-06 09:28:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:28:02,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:28:02,177 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:28:02,254 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:28:02,256 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:28:02,634 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:28:02,634 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:28:02,647 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:28:02,648 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:28:02,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:02 BoogieIcfgContainer [2025-02-06 09:28:02,648 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:28:02,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:28:02,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:28:02,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:28:02,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:28:01" (1/3) ... [2025-02-06 09:28:02,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e24999e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:28:02, skipping insertion in model container [2025-02-06 09:28:02,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:02" (2/3) ... [2025-02-06 09:28:02,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e24999e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:28:02, skipping insertion in model container [2025-02-06 09:28:02,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:02" (3/3) ... [2025-02-06 09:28:02,657 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2025-02-06 09:28:02,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:28:02,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3.wvr.c that has 7 procedures, 353 locations, 1 initial locations, 6 loop locations, and 52 error locations. [2025-02-06 09:28:02,670 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:28:02,764 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-02-06 09:28:02,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 373 transitions, 788 flow [2025-02-06 09:28:02,922 INFO L124 PetriNetUnfolderBase]: 21/367 cut-off events. [2025-02-06 09:28:02,924 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:28:02,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 367 events. 21/367 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 719 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 300. Up to 2 conditions per place. [2025-02-06 09:28:02,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 371 places, 373 transitions, 788 flow [2025-02-06 09:28:02,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 346 transitions, 728 flow [2025-02-06 09:28:02,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:28:02,951 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;@37821718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:28:02,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2025-02-06 09:28:02,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:28:02,958 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-06 09:28:02,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:28:02,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:02,959 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] [2025-02-06 09:28:02,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2018823382, now seen corresponding path program 1 times [2025-02-06 09:28:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:02,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649359442] [2025-02-06 09:28:02,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:03,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 09:28:03,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 09:28:03,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:03,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:03,092 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-06 09:28:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649359442] [2025-02-06 09:28:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649359442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:03,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:03,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265990647] [2025-02-06 09:28:03,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:03,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:03,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:03,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:03,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:03,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2025-02-06 09:28:03,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 346 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 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-06 09:28:03,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:03,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2025-02-06 09:28:03,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:03,283 INFO L124 PetriNetUnfolderBase]: 37/473 cut-off events. [2025-02-06 09:28:03,283 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-06 09:28:03,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 473 events. 37/473 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1719 event pairs, 20 based on Foata normal form. 91/466 useless extension candidates. Maximal degree in co-relation 485. Up to 68 conditions per place. [2025-02-06 09:28:03,294 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 22 selfloop transitions, 2 changer transitions 1/338 dead transitions. [2025-02-06 09:28:03,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 338 transitions, 760 flow [2025-02-06 09:28:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-02-06 09:28:03,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934763181411975 [2025-02-06 09:28:03,309 INFO L175 Difference]: Start difference. First operand has 346 places, 346 transitions, 728 flow. Second operand 3 states and 1046 transitions. [2025-02-06 09:28:03,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 338 transitions, 760 flow [2025-02-06 09:28:03,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 338 transitions, 736 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-06 09:28:03,321 INFO L231 Difference]: Finished difference. Result has 335 places, 337 transitions, 690 flow [2025-02-06 09:28:03,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=335, PETRI_TRANSITIONS=337} [2025-02-06 09:28:03,327 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -11 predicate places. [2025-02-06 09:28:03,327 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 337 transitions, 690 flow [2025-02-06 09:28:03,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 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-06 09:28:03,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:03,328 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] [2025-02-06 09:28:03,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:28:03,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:03,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:03,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1508237092, now seen corresponding path program 1 times [2025-02-06 09:28:03,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:03,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436495518] [2025-02-06 09:28:03,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:03,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:28:03,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:28:03,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:03,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:03,384 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-06 09:28:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436495518] [2025-02-06 09:28:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436495518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:03,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702426802] [2025-02-06 09:28:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:03,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:03,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:03,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:03,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2025-02-06 09:28:03,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 337 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-06 09:28:03,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:03,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2025-02-06 09:28:03,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:03,537 INFO L124 PetriNetUnfolderBase]: 37/471 cut-off events. [2025-02-06 09:28:03,537 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:28:03,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 471 events. 37/471 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1632 event pairs, 20 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 532. Up to 67 conditions per place. [2025-02-06 09:28:03,549 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2025-02-06 09:28:03,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 336 transitions, 734 flow [2025-02-06 09:28:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-02-06 09:28:03,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2025-02-06 09:28:03,555 INFO L175 Difference]: Start difference. First operand has 335 places, 337 transitions, 690 flow. Second operand 3 states and 1041 transitions. [2025-02-06 09:28:03,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 336 transitions, 734 flow [2025-02-06 09:28:03,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 336 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:03,563 INFO L231 Difference]: Finished difference. Result has 333 places, 336 transitions, 688 flow [2025-02-06 09:28:03,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=333, PETRI_TRANSITIONS=336} [2025-02-06 09:28:03,564 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -13 predicate places. [2025-02-06 09:28:03,564 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 336 transitions, 688 flow [2025-02-06 09:28:03,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-06 09:28:03,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:03,565 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-06 09:28:03,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:28:03,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:03,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:03,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1861704403, now seen corresponding path program 1 times [2025-02-06 09:28:03,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:03,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137864802] [2025-02-06 09:28:03,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:03,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:03,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:28:03,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:28:03,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:03,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:03,616 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-06 09:28:03,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:03,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137864802] [2025-02-06 09:28:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137864802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:03,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:03,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383645563] [2025-02-06 09:28:03,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:03,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:03,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:03,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:03,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2025-02-06 09:28:03,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 336 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 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-06 09:28:03,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:03,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2025-02-06 09:28:03,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:03,724 INFO L124 PetriNetUnfolderBase]: 37/452 cut-off events. [2025-02-06 09:28:03,724 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:28:03,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 452 events. 37/452 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1456 event pairs, 20 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 503. Up to 68 conditions per place. [2025-02-06 09:28:03,730 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 22 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-02-06 09:28:03,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 335 transitions, 734 flow [2025-02-06 09:28:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-02-06 09:28:03,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285075960679178 [2025-02-06 09:28:03,750 INFO L175 Difference]: Start difference. First operand has 333 places, 336 transitions, 688 flow. Second operand 3 states and 1039 transitions. [2025-02-06 09:28:03,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 335 transitions, 734 flow [2025-02-06 09:28:03,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 335 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:03,755 INFO L231 Difference]: Finished difference. Result has 332 places, 335 transitions, 686 flow [2025-02-06 09:28:03,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=332, PETRI_TRANSITIONS=335} [2025-02-06 09:28:03,756 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -14 predicate places. [2025-02-06 09:28:03,757 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 335 transitions, 686 flow [2025-02-06 09:28:03,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 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-06 09:28:03,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:03,757 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] [2025-02-06 09:28:03,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:28:03,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:03,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1613357845, now seen corresponding path program 1 times [2025-02-06 09:28:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977974336] [2025-02-06 09:28:03,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:03,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:28:03,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:28:03,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:03,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:03,798 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-06 09:28:03,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:03,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977974336] [2025-02-06 09:28:03,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977974336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:03,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:03,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574242878] [2025-02-06 09:28:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:03,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:03,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:03,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:03,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2025-02-06 09:28:03,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 335 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-06 09:28:03,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:03,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2025-02-06 09:28:03,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:03,889 INFO L124 PetriNetUnfolderBase]: 37/433 cut-off events. [2025-02-06 09:28:03,890 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:28:03,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 433 events. 37/433 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1244 event pairs, 20 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 472. Up to 67 conditions per place. [2025-02-06 09:28:03,895 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2025-02-06 09:28:03,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 334 transitions, 730 flow [2025-02-06 09:28:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-02-06 09:28:03,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2025-02-06 09:28:03,897 INFO L175 Difference]: Start difference. First operand has 332 places, 335 transitions, 686 flow. Second operand 3 states and 1041 transitions. [2025-02-06 09:28:03,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 334 transitions, 730 flow [2025-02-06 09:28:03,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 334 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:03,901 INFO L231 Difference]: Finished difference. Result has 331 places, 334 transitions, 684 flow [2025-02-06 09:28:03,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=331, PETRI_TRANSITIONS=334} [2025-02-06 09:28:03,902 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -15 predicate places. [2025-02-06 09:28:03,902 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 334 transitions, 684 flow [2025-02-06 09:28:03,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-06 09:28:03,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:03,903 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] [2025-02-06 09:28:03,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:28:03,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:03,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash -992268525, now seen corresponding path program 1 times [2025-02-06 09:28:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252346067] [2025-02-06 09:28:03,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:03,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 09:28:03,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 09:28:03,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:03,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:03,945 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-06 09:28:03,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252346067] [2025-02-06 09:28:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252346067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882420430] [2025-02-06 09:28:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:03,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:03,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:03,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:03,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2025-02-06 09:28:03,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 334 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 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-06 09:28:03,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:03,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2025-02-06 09:28:03,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:04,087 INFO L124 PetriNetUnfolderBase]: 37/414 cut-off events. [2025-02-06 09:28:04,087 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:28:04,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 414 events. 37/414 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1082 event pairs, 20 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 443. Up to 68 conditions per place. [2025-02-06 09:28:04,090 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 22 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2025-02-06 09:28:04,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 333 transitions, 730 flow [2025-02-06 09:28:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-02-06 09:28:04,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285075960679178 [2025-02-06 09:28:04,092 INFO L175 Difference]: Start difference. First operand has 331 places, 334 transitions, 684 flow. Second operand 3 states and 1039 transitions. [2025-02-06 09:28:04,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 333 transitions, 730 flow [2025-02-06 09:28:04,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 333 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:04,096 INFO L231 Difference]: Finished difference. Result has 330 places, 333 transitions, 682 flow [2025-02-06 09:28:04,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=330, PETRI_TRANSITIONS=333} [2025-02-06 09:28:04,096 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -16 predicate places. [2025-02-06 09:28:04,097 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 333 transitions, 682 flow [2025-02-06 09:28:04,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 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-06 09:28:04,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:04,097 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] [2025-02-06 09:28:04,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:28:04,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:04,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:04,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2122782146, now seen corresponding path program 1 times [2025-02-06 09:28:04,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:04,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819156651] [2025-02-06 09:28:04,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:04,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 09:28:04,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 09:28:04,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:04,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:04,133 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-06 09:28:04,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:04,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819156651] [2025-02-06 09:28:04,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819156651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:04,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:04,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:04,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790651722] [2025-02-06 09:28:04,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:04,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:04,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:04,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:04,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:04,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2025-02-06 09:28:04,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 333 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-06 09:28:04,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:04,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2025-02-06 09:28:04,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:04,248 INFO L124 PetriNetUnfolderBase]: 37/395 cut-off events. [2025-02-06 09:28:04,248 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:28:04,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 395 events. 37/395 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 909 event pairs, 20 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 412. Up to 67 conditions per place. [2025-02-06 09:28:04,254 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/332 dead transitions. [2025-02-06 09:28:04,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 332 transitions, 726 flow [2025-02-06 09:28:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-02-06 09:28:04,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2025-02-06 09:28:04,259 INFO L175 Difference]: Start difference. First operand has 330 places, 333 transitions, 682 flow. Second operand 3 states and 1041 transitions. [2025-02-06 09:28:04,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 332 transitions, 726 flow [2025-02-06 09:28:04,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 332 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:04,264 INFO L231 Difference]: Finished difference. Result has 329 places, 332 transitions, 680 flow [2025-02-06 09:28:04,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=329, PETRI_TRANSITIONS=332} [2025-02-06 09:28:04,265 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -17 predicate places. [2025-02-06 09:28:04,265 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 332 transitions, 680 flow [2025-02-06 09:28:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-06 09:28:04,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:04,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:04,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:28:04,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1374644141, now seen corresponding path program 1 times [2025-02-06 09:28:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398101659] [2025-02-06 09:28:04,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:04,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 09:28:04,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 09:28:04,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:04,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:04,303 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-06 09:28:04,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398101659] [2025-02-06 09:28:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398101659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:04,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:04,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263874741] [2025-02-06 09:28:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:04,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:04,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:04,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:04,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2025-02-06 09:28:04,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 332 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-06 09:28:04,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:04,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2025-02-06 09:28:04,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:04,960 INFO L124 PetriNetUnfolderBase]: 755/4731 cut-off events. [2025-02-06 09:28:04,960 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-06 09:28:04,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5736 conditions, 4731 events. 755/4731 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46150 event pairs, 387 based on Foata normal form. 0/3476 useless extension candidates. Maximal degree in co-relation 5667. Up to 936 conditions per place. [2025-02-06 09:28:05,008 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-02-06 09:28:05,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 331 transitions, 724 flow [2025-02-06 09:28:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-02-06 09:28:05,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2025-02-06 09:28:05,010 INFO L175 Difference]: Start difference. First operand has 329 places, 332 transitions, 680 flow. Second operand 3 states and 1041 transitions. [2025-02-06 09:28:05,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 331 transitions, 724 flow [2025-02-06 09:28:05,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 331 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:05,016 INFO L231 Difference]: Finished difference. Result has 328 places, 331 transitions, 678 flow [2025-02-06 09:28:05,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=328, PETRI_TRANSITIONS=331} [2025-02-06 09:28:05,018 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -18 predicate places. [2025-02-06 09:28:05,018 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 331 transitions, 678 flow [2025-02-06 09:28:05,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-06 09:28:05,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:05,020 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] [2025-02-06 09:28:05,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:28:05,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:05,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1988771170, now seen corresponding path program 1 times [2025-02-06 09:28:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:05,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373478528] [2025-02-06 09:28:05,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:05,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:05,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 09:28:05,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 09:28:05,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:05,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:05,059 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-06 09:28:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373478528] [2025-02-06 09:28:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373478528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:05,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:05,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663382893] [2025-02-06 09:28:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:05,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:05,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:05,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:05,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2025-02-06 09:28:05,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 331 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 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-06 09:28:05,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:05,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2025-02-06 09:28:05,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:05,137 INFO L124 PetriNetUnfolderBase]: 52/461 cut-off events. [2025-02-06 09:28:05,137 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:28:05,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 461 events. 52/461 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1755 event pairs, 30 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 533. Up to 90 conditions per place. [2025-02-06 09:28:05,142 INFO L140 encePairwiseOnDemand]: 364/373 looper letters, 29 selfloop transitions, 3 changer transitions 0/331 dead transitions. [2025-02-06 09:28:05,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 331 transitions, 747 flow [2025-02-06 09:28:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1034 transitions. [2025-02-06 09:28:05,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9240393208221627 [2025-02-06 09:28:05,144 INFO L175 Difference]: Start difference. First operand has 328 places, 331 transitions, 678 flow. Second operand 3 states and 1034 transitions. [2025-02-06 09:28:05,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 331 transitions, 747 flow [2025-02-06 09:28:05,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 331 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:05,150 INFO L231 Difference]: Finished difference. Result has 323 places, 326 transitions, 675 flow [2025-02-06 09:28:05,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=323, PETRI_TRANSITIONS=326} [2025-02-06 09:28:05,155 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -23 predicate places. [2025-02-06 09:28:05,155 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 326 transitions, 675 flow [2025-02-06 09:28:05,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 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-06 09:28:05,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:05,156 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-06 09:28:05,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:28:05,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:05,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash 51371402, now seen corresponding path program 1 times [2025-02-06 09:28:05,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:05,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112530614] [2025-02-06 09:28:05,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:05,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 09:28:05,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 09:28:05,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:05,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:05,185 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-06 09:28:05,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:05,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112530614] [2025-02-06 09:28:05,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112530614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:05,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:05,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:05,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688963559] [2025-02-06 09:28:05,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:05,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:05,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:05,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:05,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:05,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2025-02-06 09:28:05,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 326 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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-06 09:28:05,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:05,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2025-02-06 09:28:05,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:05,257 INFO L124 PetriNetUnfolderBase]: 52/457 cut-off events. [2025-02-06 09:28:05,257 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:28:05,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 457 events. 52/457 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1668 event pairs, 30 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 515. Up to 88 conditions per place. [2025-02-06 09:28:05,261 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 27 selfloop transitions, 3 changer transitions 0/327 dead transitions. [2025-02-06 09:28:05,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 327 transitions, 742 flow [2025-02-06 09:28:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2025-02-06 09:28:05,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2025-02-06 09:28:05,263 INFO L175 Difference]: Start difference. First operand has 323 places, 326 transitions, 675 flow. Second operand 3 states and 1040 transitions. [2025-02-06 09:28:05,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 327 transitions, 742 flow [2025-02-06 09:28:05,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 327 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:05,266 INFO L231 Difference]: Finished difference. Result has 320 places, 322 transitions, 675 flow [2025-02-06 09:28:05,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=320, PETRI_TRANSITIONS=322} [2025-02-06 09:28:05,267 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -26 predicate places. [2025-02-06 09:28:05,267 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 322 transitions, 675 flow [2025-02-06 09:28:05,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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-06 09:28:05,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:05,268 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-06 09:28:05,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:28:05,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:05,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash 846118562, now seen corresponding path program 1 times [2025-02-06 09:28:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:05,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587917435] [2025-02-06 09:28:05,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:05,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:05,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 09:28:05,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 09:28:05,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:05,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:05,325 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-06 09:28:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587917435] [2025-02-06 09:28:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587917435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:05,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815099564] [2025-02-06 09:28:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:05,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:05,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:05,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:05,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2025-02-06 09:28:05,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 322 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 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-06 09:28:05,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:05,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2025-02-06 09:28:05,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:05,450 INFO L124 PetriNetUnfolderBase]: 70/752 cut-off events. [2025-02-06 09:28:05,450 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 09:28:05,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 752 events. 70/752 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3771 event pairs, 25 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 825. Up to 96 conditions per place. [2025-02-06 09:28:05,459 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 32 selfloop transitions, 4 changer transitions 0/326 dead transitions. [2025-02-06 09:28:05,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 326 transitions, 763 flow [2025-02-06 09:28:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2025-02-06 09:28:05,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276139410187667 [2025-02-06 09:28:05,461 INFO L175 Difference]: Start difference. First operand has 320 places, 322 transitions, 675 flow. Second operand 3 states and 1038 transitions. [2025-02-06 09:28:05,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 326 transitions, 763 flow [2025-02-06 09:28:05,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 326 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:05,465 INFO L231 Difference]: Finished difference. Result has 316 places, 318 transitions, 680 flow [2025-02-06 09:28:05,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=316, PETRI_TRANSITIONS=318} [2025-02-06 09:28:05,467 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -30 predicate places. [2025-02-06 09:28:05,467 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 318 transitions, 680 flow [2025-02-06 09:28:05,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 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-06 09:28:05,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:05,467 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] [2025-02-06 09:28:05,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:28:05,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1371135456, now seen corresponding path program 1 times [2025-02-06 09:28:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:05,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099025769] [2025-02-06 09:28:05,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:05,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:05,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 09:28:05,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 09:28:05,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:05,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:05,498 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-06 09:28:05,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099025769] [2025-02-06 09:28:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099025769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:05,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858597416] [2025-02-06 09:28:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:05,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:05,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:05,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:05,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2025-02-06 09:28:05,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 318 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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-06 09:28:05,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:05,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2025-02-06 09:28:05,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:05,642 INFO L124 PetriNetUnfolderBase]: 104/910 cut-off events. [2025-02-06 09:28:05,642 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-06 09:28:05,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 910 events. 104/910 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5034 event pairs, 9 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 875. Up to 151 conditions per place. [2025-02-06 09:28:05,652 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 31 selfloop transitions, 3 changer transitions 0/323 dead transitions. [2025-02-06 09:28:05,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 323 transitions, 767 flow [2025-02-06 09:28:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1044 transitions. [2025-02-06 09:28:05,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9329758713136729 [2025-02-06 09:28:05,655 INFO L175 Difference]: Start difference. First operand has 316 places, 318 transitions, 680 flow. Second operand 3 states and 1044 transitions. [2025-02-06 09:28:05,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 323 transitions, 767 flow [2025-02-06 09:28:05,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 323 transitions, 763 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:05,659 INFO L231 Difference]: Finished difference. Result has 313 places, 314 transitions, 679 flow [2025-02-06 09:28:05,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=313, PETRI_TRANSITIONS=314} [2025-02-06 09:28:05,660 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -33 predicate places. [2025-02-06 09:28:05,660 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 314 transitions, 679 flow [2025-02-06 09:28:05,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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-06 09:28:05,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:05,661 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-06 09:28:05,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:28:05,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:05,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1597587602, now seen corresponding path program 1 times [2025-02-06 09:28:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958540245] [2025-02-06 09:28:05,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:05,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:28:05,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:28:05,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:05,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:05,704 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-06 09:28:05,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958540245] [2025-02-06 09:28:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958540245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:05,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:05,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54648507] [2025-02-06 09:28:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:05,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:05,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:05,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:05,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2025-02-06 09:28:05,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 314 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 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-06 09:28:05,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:05,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2025-02-06 09:28:05,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:05,893 INFO L124 PetriNetUnfolderBase]: 153/1421 cut-off events. [2025-02-06 09:28:05,893 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-02-06 09:28:05,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1421 events. 153/1421 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9634 event pairs, 12 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1329. Up to 235 conditions per place. [2025-02-06 09:28:05,905 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 34 selfloop transitions, 4 changer transitions 0/320 dead transitions. [2025-02-06 09:28:05,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 320 transitions, 777 flow [2025-02-06 09:28:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2025-02-06 09:28:05,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2025-02-06 09:28:05,908 INFO L175 Difference]: Start difference. First operand has 313 places, 314 transitions, 679 flow. Second operand 3 states and 1040 transitions. [2025-02-06 09:28:05,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 320 transitions, 777 flow [2025-02-06 09:28:05,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 320 transitions, 774 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:05,913 INFO L231 Difference]: Finished difference. Result has 309 places, 310 transitions, 684 flow [2025-02-06 09:28:05,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=309, PETRI_TRANSITIONS=310} [2025-02-06 09:28:05,915 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -37 predicate places. [2025-02-06 09:28:05,915 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 310 transitions, 684 flow [2025-02-06 09:28:05,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 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-06 09:28:05,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:05,916 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-06 09:28:05,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:28:05,916 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:05,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:05,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1978373940, now seen corresponding path program 1 times [2025-02-06 09:28:05,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:05,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935830395] [2025-02-06 09:28:05,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:05,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:28:05,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:28:05,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:05,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:05,957 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-06 09:28:05,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:05,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935830395] [2025-02-06 09:28:05,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935830395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:05,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:05,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782395860] [2025-02-06 09:28:05,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:05,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:05,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:05,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:05,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:05,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2025-02-06 09:28:05,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 310 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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-06 09:28:05,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:05,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2025-02-06 09:28:05,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:06,164 INFO L124 PetriNetUnfolderBase]: 222/1843 cut-off events. [2025-02-06 09:28:06,164 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-06 09:28:06,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 1843 events. 222/1843 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 13624 event pairs, 95 based on Foata normal form. 1/1698 useless extension candidates. Maximal degree in co-relation 1714. Up to 332 conditions per place. [2025-02-06 09:28:06,182 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 30 selfloop transitions, 3 changer transitions 18/317 dead transitions. [2025-02-06 09:28:06,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 317 transitions, 779 flow [2025-02-06 09:28:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2025-02-06 09:28:06,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9338695263628239 [2025-02-06 09:28:06,184 INFO L175 Difference]: Start difference. First operand has 309 places, 310 transitions, 684 flow. Second operand 3 states and 1045 transitions. [2025-02-06 09:28:06,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 317 transitions, 779 flow [2025-02-06 09:28:06,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 317 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:06,212 INFO L231 Difference]: Finished difference. Result has 306 places, 288 transitions, 646 flow [2025-02-06 09:28:06,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=306, PETRI_TRANSITIONS=288} [2025-02-06 09:28:06,213 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -40 predicate places. [2025-02-06 09:28:06,213 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 288 transitions, 646 flow [2025-02-06 09:28:06,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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-06 09:28:06,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:06,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:06,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:28:06,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:06,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:06,214 INFO L85 PathProgramCache]: Analyzing trace with hash 474199985, now seen corresponding path program 1 times [2025-02-06 09:28:06,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:06,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905392439] [2025-02-06 09:28:06,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:06,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:28:06,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:28:06,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:06,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:06,261 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-06 09:28:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905392439] [2025-02-06 09:28:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905392439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507218548] [2025-02-06 09:28:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:06,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:06,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:06,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:06,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 373 [2025-02-06 09:28:06,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 288 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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-06 09:28:06,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:06,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 373 [2025-02-06 09:28:06,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:13,238 INFO L124 PetriNetUnfolderBase]: 18691/70752 cut-off events. [2025-02-06 09:28:13,239 INFO L125 PetriNetUnfolderBase]: For 1780/1780 co-relation queries the response was YES. [2025-02-06 09:28:13,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102346 conditions, 70752 events. 18691/70752 cut-off events. For 1780/1780 co-relation queries the response was YES. Maximal size of possible extension queue 2563. Compared 1065698 event pairs, 9985 based on Foata normal form. 0/60871 useless extension candidates. Maximal degree in co-relation 36296. Up to 23154 conditions per place. [2025-02-06 09:28:13,977 INFO L140 encePairwiseOnDemand]: 361/373 looper letters, 29 selfloop transitions, 6 changer transitions 0/293 dead transitions. [2025-02-06 09:28:13,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 293 transitions, 731 flow [2025-02-06 09:28:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2025-02-06 09:28:13,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2025-02-06 09:28:13,981 INFO L175 Difference]: Start difference. First operand has 306 places, 288 transitions, 646 flow. Second operand 3 states and 1040 transitions. [2025-02-06 09:28:13,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 293 transitions, 731 flow [2025-02-06 09:28:14,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 293 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:14,083 INFO L231 Difference]: Finished difference. Result has 285 places, 288 transitions, 673 flow [2025-02-06 09:28:14,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=285, PETRI_TRANSITIONS=288} [2025-02-06 09:28:14,085 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -61 predicate places. [2025-02-06 09:28:14,085 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 288 transitions, 673 flow [2025-02-06 09:28:14,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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-06 09:28:14,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:14,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:14,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:28:14,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:14,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash -974301602, now seen corresponding path program 1 times [2025-02-06 09:28:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694303296] [2025-02-06 09:28:14,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:14,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 09:28:14,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 09:28:14,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:14,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:14,133 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-06 09:28:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:14,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694303296] [2025-02-06 09:28:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694303296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:14,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:14,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700902219] [2025-02-06 09:28:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:14,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:14,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:14,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:14,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2025-02-06 09:28:14,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 288 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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-06 09:28:14,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:14,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2025-02-06 09:28:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:15,151 INFO L124 PetriNetUnfolderBase]: 2051/10608 cut-off events. [2025-02-06 09:28:15,151 INFO L125 PetriNetUnfolderBase]: For 73/109 co-relation queries the response was YES. [2025-02-06 09:28:15,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15083 conditions, 10608 events. 2051/10608 cut-off events. For 73/109 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 128626 event pairs, 546 based on Foata normal form. 0/9040 useless extension candidates. Maximal degree in co-relation 8297. Up to 2106 conditions per place. [2025-02-06 09:28:15,282 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 25 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-02-06 09:28:15,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 292 transitions, 740 flow [2025-02-06 09:28:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2025-02-06 09:28:15,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2025-02-06 09:28:15,284 INFO L175 Difference]: Start difference. First operand has 285 places, 288 transitions, 673 flow. Second operand 3 states and 1047 transitions. [2025-02-06 09:28:15,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 292 transitions, 740 flow [2025-02-06 09:28:15,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 292 transitions, 740 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:15,292 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 675 flow [2025-02-06 09:28:15,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=286, PETRI_TRANSITIONS=287} [2025-02-06 09:28:15,293 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -60 predicate places. [2025-02-06 09:28:15,293 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 675 flow [2025-02-06 09:28:15,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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-06 09:28:15,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:15,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:15,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:28:15,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -143080230, now seen corresponding path program 1 times [2025-02-06 09:28:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904460448] [2025-02-06 09:28:15,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 09:28:15,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 09:28:15,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:15,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:15,333 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-06 09:28:15,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:15,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904460448] [2025-02-06 09:28:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904460448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:15,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:15,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55891075] [2025-02-06 09:28:15,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:15,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:15,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:15,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:15,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2025-02-06 09:28:15,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 287 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 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-06 09:28:15,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:15,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2025-02-06 09:28:15,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:17,266 INFO L124 PetriNetUnfolderBase]: 3507/16354 cut-off events. [2025-02-06 09:28:17,266 INFO L125 PetriNetUnfolderBase]: For 424/448 co-relation queries the response was YES. [2025-02-06 09:28:17,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24232 conditions, 16354 events. 3507/16354 cut-off events. For 424/448 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 210513 event pairs, 1169 based on Foata normal form. 0/14355 useless extension candidates. Maximal degree in co-relation 23443. Up to 2985 conditions per place. [2025-02-06 09:28:17,438 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 24 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-02-06 09:28:17,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 291 transitions, 740 flow [2025-02-06 09:28:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2025-02-06 09:28:17,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2025-02-06 09:28:17,440 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 675 flow. Second operand 3 states and 1049 transitions. [2025-02-06 09:28:17,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 291 transitions, 740 flow [2025-02-06 09:28:17,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 291 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:17,452 INFO L231 Difference]: Finished difference. Result has 285 places, 286 transitions, 673 flow [2025-02-06 09:28:17,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=285, PETRI_TRANSITIONS=286} [2025-02-06 09:28:17,453 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -61 predicate places. [2025-02-06 09:28:17,453 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 286 transitions, 673 flow [2025-02-06 09:28:17,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 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-06 09:28:17,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:17,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:17,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:28:17,454 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:17,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:17,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2099676789, now seen corresponding path program 1 times [2025-02-06 09:28:17,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:17,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632225109] [2025-02-06 09:28:17,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:17,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 09:28:17,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 09:28:17,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:17,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:17,505 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-06 09:28:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632225109] [2025-02-06 09:28:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632225109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:17,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:17,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308783564] [2025-02-06 09:28:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:17,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:17,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:17,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:17,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:17,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2025-02-06 09:28:17,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 286 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 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-06 09:28:17,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:17,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2025-02-06 09:28:17,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:19,199 INFO L124 PetriNetUnfolderBase]: 3083/13658 cut-off events. [2025-02-06 09:28:19,199 INFO L125 PetriNetUnfolderBase]: For 545/563 co-relation queries the response was YES. [2025-02-06 09:28:19,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20714 conditions, 13658 events. 3083/13658 cut-off events. For 545/563 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 168973 event pairs, 1008 based on Foata normal form. 0/12105 useless extension candidates. Maximal degree in co-relation 19578. Up to 2533 conditions per place. [2025-02-06 09:28:19,355 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 26 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-02-06 09:28:19,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 290 transitions, 742 flow [2025-02-06 09:28:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2025-02-06 09:28:19,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2025-02-06 09:28:19,357 INFO L175 Difference]: Start difference. First operand has 285 places, 286 transitions, 673 flow. Second operand 3 states and 1047 transitions. [2025-02-06 09:28:19,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 290 transitions, 742 flow [2025-02-06 09:28:19,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 290 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:19,364 INFO L231 Difference]: Finished difference. Result has 284 places, 285 transitions, 671 flow [2025-02-06 09:28:19,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=284, PETRI_TRANSITIONS=285} [2025-02-06 09:28:19,365 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -62 predicate places. [2025-02-06 09:28:19,365 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 285 transitions, 671 flow [2025-02-06 09:28:19,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 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-06 09:28:19,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:19,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:19,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:28:19,366 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:19,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1134368916, now seen corresponding path program 1 times [2025-02-06 09:28:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308085608] [2025-02-06 09:28:19,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:19,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 09:28:19,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 09:28:19,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:19,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:19,399 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-06 09:28:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308085608] [2025-02-06 09:28:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308085608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348249925] [2025-02-06 09:28:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:19,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:19,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:19,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:19,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2025-02-06 09:28:19,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 285 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 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-06 09:28:19,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:19,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2025-02-06 09:28:19,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:20,620 INFO L124 PetriNetUnfolderBase]: 2733/11673 cut-off events. [2025-02-06 09:28:20,620 INFO L125 PetriNetUnfolderBase]: For 608/639 co-relation queries the response was YES. [2025-02-06 09:28:20,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18158 conditions, 11673 events. 2733/11673 cut-off events. For 608/639 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 139470 event pairs, 934 based on Foata normal form. 3/10458 useless extension candidates. Maximal degree in co-relation 17137. Up to 2195 conditions per place. [2025-02-06 09:28:20,767 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 24 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-02-06 09:28:20,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 289 transitions, 736 flow [2025-02-06 09:28:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2025-02-06 09:28:20,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2025-02-06 09:28:20,768 INFO L175 Difference]: Start difference. First operand has 284 places, 285 transitions, 671 flow. Second operand 3 states and 1049 transitions. [2025-02-06 09:28:20,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 289 transitions, 736 flow [2025-02-06 09:28:20,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 289 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:20,776 INFO L231 Difference]: Finished difference. Result has 283 places, 284 transitions, 669 flow [2025-02-06 09:28:20,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=283, PETRI_TRANSITIONS=284} [2025-02-06 09:28:20,777 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -63 predicate places. [2025-02-06 09:28:20,777 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 284 transitions, 669 flow [2025-02-06 09:28:20,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 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-06 09:28:20,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:20,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:20,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:28:20,778 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:20,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1408646545, now seen corresponding path program 1 times [2025-02-06 09:28:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031510861] [2025-02-06 09:28:20,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:20,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 09:28:20,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 09:28:20,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:20,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:20,810 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-06 09:28:20,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031510861] [2025-02-06 09:28:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031510861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720465696] [2025-02-06 09:28:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:20,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:20,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:20,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:20,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2025-02-06 09:28:20,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 284 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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-06 09:28:20,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:20,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2025-02-06 09:28:20,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:21,799 INFO L124 PetriNetUnfolderBase]: 2073/9464 cut-off events. [2025-02-06 09:28:21,799 INFO L125 PetriNetUnfolderBase]: For 560/604 co-relation queries the response was YES. [2025-02-06 09:28:21,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14298 conditions, 9464 events. 2073/9464 cut-off events. For 560/604 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 108243 event pairs, 676 based on Foata normal form. 5/8455 useless extension candidates. Maximal degree in co-relation 13034. Up to 1876 conditions per place. [2025-02-06 09:28:21,900 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 26 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-02-06 09:28:21,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 288 transitions, 738 flow [2025-02-06 09:28:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2025-02-06 09:28:21,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2025-02-06 09:28:21,902 INFO L175 Difference]: Start difference. First operand has 283 places, 284 transitions, 669 flow. Second operand 3 states and 1047 transitions. [2025-02-06 09:28:21,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 288 transitions, 738 flow [2025-02-06 09:28:21,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 288 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:21,909 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 667 flow [2025-02-06 09:28:21,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2025-02-06 09:28:21,909 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -64 predicate places. [2025-02-06 09:28:21,909 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 667 flow [2025-02-06 09:28:21,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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-06 09:28:21,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:21,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:28:21,910 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-06 09:28:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash 561562516, now seen corresponding path program 1 times [2025-02-06 09:28:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290418974] [2025-02-06 09:28:21,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:21,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 09:28:21,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 09:28:21,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:21,939 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-06 09:28:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:21,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290418974] [2025-02-06 09:28:21,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290418974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:21,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:21,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965927739] [2025-02-06 09:28:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:21,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:21,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:21,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:21,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2025-02-06 09:28:21,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 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-06 09:28:21,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:21,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2025-02-06 09:28:21,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:22,606 INFO L124 PetriNetUnfolderBase]: 1397/7322 cut-off events. [2025-02-06 09:28:22,606 INFO L125 PetriNetUnfolderBase]: For 297/325 co-relation queries the response was YES. [2025-02-06 09:28:22,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10437 conditions, 7322 events. 1397/7322 cut-off events. For 297/325 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 79615 event pairs, 375 based on Foata normal form. 4/6537 useless extension candidates. Maximal degree in co-relation 9618. Up to 1480 conditions per place. [2025-02-06 09:28:22,669 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2025-02-06 09:28:22,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 287 transitions, 732 flow [2025-02-06 09:28:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2025-02-06 09:28:22,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2025-02-06 09:28:22,670 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 667 flow. Second operand 3 states and 1049 transitions. [2025-02-06 09:28:22,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 287 transitions, 732 flow [2025-02-06 09:28:22,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 287 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:22,676 INFO L231 Difference]: Finished difference. Result has 281 places, 0 transitions, 0 flow [2025-02-06 09:28:22,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=281, PETRI_TRANSITIONS=0} [2025-02-06 09:28:22,676 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -65 predicate places. [2025-02-06 09:28:22,676 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 0 transitions, 0 flow [2025-02-06 09:28:22,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 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-06 09:28:22,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (87 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (86 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (85 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (83 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (82 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (81 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (80 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (79 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (78 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (77 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (76 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (75 of 88 remaining) [2025-02-06 09:28:22,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (74 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (73 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (72 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (71 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (70 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (68 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (67 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (64 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (63 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (62 of 88 remaining) [2025-02-06 09:28:22,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (61 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (59 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (58 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (57 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (54 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 88 remaining) [2025-02-06 09:28:22,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (44 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (43 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (41 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (40 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (39 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (38 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (36 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (35 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (34 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (33 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 88 remaining) [2025-02-06 09:28:22,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (31 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (30 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (19 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 88 remaining) [2025-02-06 09:28:22,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (14 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (13 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (11 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (9 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (8 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (5 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 88 remaining) [2025-02-06 09:28:22,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 88 remaining) [2025-02-06 09:28:22,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:28:22,686 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:22,689 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:28:22,689 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:28:22,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:28:22 BasicIcfg [2025-02-06 09:28:22,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:28:22,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:28:22,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:28:22,694 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:28:22,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:02" (3/4) ... [2025-02-06 09:28:22,696 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:28:22,698 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:28:22,698 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:28:22,698 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:28:22,698 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-06 09:28:22,698 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-02-06 09:28:22,698 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-02-06 09:28:22,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-06 09:28:22,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 09:28:22,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 09:28:22,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:28:22,763 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:28:22,764 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:28:22,764 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:28:22,764 INFO L158 Benchmark]: Toolchain (without parser) took 20870.47ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 105.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-02-06 09:28:22,764 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.3MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:28:22,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.79ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 92.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:28:22,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.22ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:28:22,765 INFO L158 Benchmark]: Boogie Preprocessor took 15.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:28:22,765 INFO L158 Benchmark]: IcfgBuilder took 520.08ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 64.2MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:28:22,765 INFO L158 Benchmark]: TraceAbstraction took 20041.72ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 64.2MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-02-06 09:28:22,765 INFO L158 Benchmark]: Witness Printer took 69.79ms. Allocated memory is still 4.2GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:28:22,766 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.20ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.3MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.79ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 92.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.22ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 520.08ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 64.2MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20041.72ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 64.2MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 69.79ms. Allocated memory is still 4.2GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: 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: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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 13 procedures, 497 locations, 88 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: 19.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1010 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1169 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 202 mSDtfsCounter, 1169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=0, InterpolantAutomatonStates: 60, 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.6s InterpolantComputationTime, 1679 NumberOfCodeBlocks, 1679 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1659 ConstructedInterpolants, 0 QuantifiedInterpolants, 1699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 52 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:28:22,782 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