./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:22:43,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:22:43,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:22:43,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:22:43,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:22:43,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:22:43,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:22:43,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:22:43,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:22:43,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:22:43,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:22:43,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:22:43,897 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:22:43,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:22:43,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:22:43,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:22:43,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:22:43,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:22:43,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:22:43,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:22:43,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:22:43,900 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-03-13 22:22:44,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:22:44,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:22:44,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:22:44,131 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:22:44,131 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:22:44,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-03-13 22:22:45,279 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb224abfa/66c48a0e7ae244d6bb2bb7baa8da71cd/FLAG53cbcb0a3 [2025-03-13 22:22:45,508 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:22:45,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-03-13 22:22:45,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb224abfa/66c48a0e7ae244d6bb2bb7baa8da71cd/FLAG53cbcb0a3 [2025-03-13 22:22:45,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb224abfa/66c48a0e7ae244d6bb2bb7baa8da71cd [2025-03-13 22:22:45,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:22:45,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:22:45,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:22:45,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:22:45,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:22:45,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:22:45" (1/1) ... [2025-03-13 22:22:45,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdc26a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:45, skipping insertion in model container [2025-03-13 22:22:45,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:22:45" (1/1) ... [2025-03-13 22:22:45,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:22:45,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:22:46,000 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:22:46,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:22:46,026 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:22:46,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46 WrapperNode [2025-03-13 22:22:46,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:22:46,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:22:46,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:22:46,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:22:46,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,057 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 269 [2025-03-13 22:22:46,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:22:46,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:22:46,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:22:46,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:22:46,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:22:46,087 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:22:46,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:22:46,089 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:22:46,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (1/1) ... [2025-03-13 22:22:46,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:22:46,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:46,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:22:46,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:22:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:22:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:22:46,134 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:22:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:22:46,134 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:22:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:22:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:22:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:22:46,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:22:46,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:22:46,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:22:46,136 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:22:46,219 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:22:46,221 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:22:46,601 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:22:46,603 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:22:46,603 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:22:46,622 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:22:46,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:22:46 BoogieIcfgContainer [2025-03-13 22:22:46,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:22:46,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:22:46,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:22:46,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:22:46,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:22:45" (1/3) ... [2025-03-13 22:22:46,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5702d599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:22:46, skipping insertion in model container [2025-03-13 22:22:46,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:22:46" (2/3) ... [2025-03-13 22:22:46,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5702d599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:22:46, skipping insertion in model container [2025-03-13 22:22:46,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:22:46" (3/3) ... [2025-03-13 22:22:46,634 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-03-13 22:22:46,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:22:46,647 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 328 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-03-13 22:22:46,648 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:22:46,743 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:22:46,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 344 transitions, 702 flow [2025-03-13 22:22:46,906 INFO L124 PetriNetUnfolderBase]: 17/342 cut-off events. [2025-03-13 22:22:46,908 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:22:46,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 342 events. 17/342 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 683 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 234. Up to 3 conditions per place. [2025-03-13 22:22:46,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 344 transitions, 702 flow [2025-03-13 22:22:46,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 316 places, 325 transitions, 662 flow [2025-03-13 22:22:46,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:22:46,941 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;@39a399d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:22:46,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-03-13 22:22:46,953 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:22:46,953 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2025-03-13 22:22:46,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:22:46,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:46,954 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] [2025-03-13 22:22:46,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:46,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1862329975, now seen corresponding path program 1 times [2025-03-13 22:22:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247487593] [2025-03-13 22:22:46,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:46,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:47,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:22:47,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:22:47,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:47,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247487593] [2025-03-13 22:22:47,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247487593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:47,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136462290] [2025-03-13 22:22:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:47,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:47,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:47,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:47,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:47,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 344 [2025-03-13 22:22:47,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 325 transitions, 662 flow. Second operand has 6 states, 6 states have (on average 271.5) internal successors, (1629), 6 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:47,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:47,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 344 [2025-03-13 22:22:47,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:48,276 INFO L124 PetriNetUnfolderBase]: 424/2283 cut-off events. [2025-03-13 22:22:48,276 INFO L125 PetriNetUnfolderBase]: For 157/158 co-relation queries the response was YES. [2025-03-13 22:22:48,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 2283 events. 424/2283 cut-off events. For 157/158 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 16201 event pairs, 288 based on Foata normal form. 98/1985 useless extension candidates. Maximal degree in co-relation 2685. Up to 709 conditions per place. [2025-03-13 22:22:48,294 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 52 selfloop transitions, 10 changer transitions 4/315 dead transitions. [2025-03-13 22:22:48,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 766 flow [2025-03-13 22:22:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1692 transitions. [2025-03-13 22:22:48,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8197674418604651 [2025-03-13 22:22:48,314 INFO L175 Difference]: Start difference. First operand has 316 places, 325 transitions, 662 flow. Second operand 6 states and 1692 transitions. [2025-03-13 22:22:48,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 766 flow [2025-03-13 22:22:48,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 758 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:22:48,326 INFO L231 Difference]: Finished difference. Result has 315 places, 311 transitions, 646 flow [2025-03-13 22:22:48,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=315, PETRI_TRANSITIONS=311} [2025-03-13 22:22:48,332 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -1 predicate places. [2025-03-13 22:22:48,334 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 311 transitions, 646 flow [2025-03-13 22:22:48,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 271.5) internal successors, (1629), 6 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:48,335 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] [2025-03-13 22:22:48,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:22:48,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:48,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1374464241, now seen corresponding path program 1 times [2025-03-13 22:22:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737393017] [2025-03-13 22:22:48,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:48,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:22:48,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:22:48,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:48,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:48,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737393017] [2025-03-13 22:22:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737393017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137238197] [2025-03-13 22:22:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:48,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:48,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:48,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:48,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 344 [2025-03-13 22:22:48,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 311 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:48,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 344 [2025-03-13 22:22:48,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:48,461 INFO L124 PetriNetUnfolderBase]: 22/488 cut-off events. [2025-03-13 22:22:48,461 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:22:48,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 488 events. 22/488 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1550 event pairs, 8 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 501. Up to 28 conditions per place. [2025-03-13 22:22:48,464 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 11 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-03-13 22:22:48,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 670 flow [2025-03-13 22:22:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-03-13 22:22:48,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408914728682171 [2025-03-13 22:22:48,468 INFO L175 Difference]: Start difference. First operand has 315 places, 311 transitions, 646 flow. Second operand 3 states and 971 transitions. [2025-03-13 22:22:48,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 670 flow [2025-03-13 22:22:48,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 310 transitions, 650 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:48,476 INFO L231 Difference]: Finished difference. Result has 307 places, 310 transitions, 628 flow [2025-03-13 22:22:48,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=307, PETRI_TRANSITIONS=310} [2025-03-13 22:22:48,477 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -9 predicate places. [2025-03-13 22:22:48,477 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 628 flow [2025-03-13 22:22:48,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:48,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:48,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:22:48,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -972732439, now seen corresponding path program 1 times [2025-03-13 22:22:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211431870] [2025-03-13 22:22:48,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:48,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:22:48,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:22:48,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:48,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:48,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211431870] [2025-03-13 22:22:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211431870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:48,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:48,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140629223] [2025-03-13 22:22:48,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:48,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:48,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:48,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:48,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 344 [2025-03-13 22:22:48,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 310 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:48,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 344 [2025-03-13 22:22:48,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:48,624 INFO L124 PetriNetUnfolderBase]: 22/487 cut-off events. [2025-03-13 22:22:48,625 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:22:48,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 487 events. 22/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1450 event pairs, 8 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 456. Up to 28 conditions per place. [2025-03-13 22:22:48,629 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 11 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-03-13 22:22:48,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 652 flow [2025-03-13 22:22:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-03-13 22:22:48,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408914728682171 [2025-03-13 22:22:48,633 INFO L175 Difference]: Start difference. First operand has 307 places, 310 transitions, 628 flow. Second operand 3 states and 971 transitions. [2025-03-13 22:22:48,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 652 flow [2025-03-13 22:22:48,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 309 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:48,638 INFO L231 Difference]: Finished difference. Result has 306 places, 309 transitions, 626 flow [2025-03-13 22:22:48,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=306, PETRI_TRANSITIONS=309} [2025-03-13 22:22:48,639 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -10 predicate places. [2025-03-13 22:22:48,640 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 626 flow [2025-03-13 22:22:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:48,641 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-03-13 22:22:48,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:22:48,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:48,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash 357247666, now seen corresponding path program 1 times [2025-03-13 22:22:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:48,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518317841] [2025-03-13 22:22:48,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:48,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-13 22:22:48,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-13 22:22:48,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:48,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518317841] [2025-03-13 22:22:48,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518317841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:48,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884164599] [2025-03-13 22:22:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:48,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:48,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:48,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:48,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 344 [2025-03-13 22:22:48,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:48,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 344 [2025-03-13 22:22:48,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:48,766 INFO L124 PetriNetUnfolderBase]: 17/468 cut-off events. [2025-03-13 22:22:48,767 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:22:48,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 468 events. 17/468 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1444 event pairs, 3 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 377. Up to 16 conditions per place. [2025-03-13 22:22:48,769 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 9 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-03-13 22:22:48,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 308 transitions, 646 flow [2025-03-13 22:22:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-03-13 22:22:48,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9447674418604651 [2025-03-13 22:22:48,772 INFO L175 Difference]: Start difference. First operand has 306 places, 309 transitions, 626 flow. Second operand 3 states and 975 transitions. [2025-03-13 22:22:48,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 308 transitions, 646 flow [2025-03-13 22:22:48,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 308 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:48,776 INFO L231 Difference]: Finished difference. Result has 305 places, 308 transitions, 624 flow [2025-03-13 22:22:48,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=305, PETRI_TRANSITIONS=308} [2025-03-13 22:22:48,777 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -11 predicate places. [2025-03-13 22:22:48,777 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 624 flow [2025-03-13 22:22:48,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:48,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] [2025-03-13 22:22:48,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:22:48,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:48,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1707045123, now seen corresponding path program 1 times [2025-03-13 22:22:48,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:48,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130577954] [2025-03-13 22:22:48,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:48,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:22:48,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:22:48,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:48,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:48,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130577954] [2025-03-13 22:22:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130577954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:48,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:48,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157180275] [2025-03-13 22:22:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:48,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:48,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:48,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:48,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:48,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 344 [2025-03-13 22:22:48,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:48,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 344 [2025-03-13 22:22:48,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:48,877 INFO L124 PetriNetUnfolderBase]: 14/395 cut-off events. [2025-03-13 22:22:48,877 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:22:48,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 395 events. 14/395 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 970 event pairs, 3 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. [2025-03-13 22:22:48,879 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 9 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2025-03-13 22:22:48,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 307 transitions, 644 flow [2025-03-13 22:22:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-03-13 22:22:48,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9447674418604651 [2025-03-13 22:22:48,882 INFO L175 Difference]: Start difference. First operand has 305 places, 308 transitions, 624 flow. Second operand 3 states and 975 transitions. [2025-03-13 22:22:48,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 307 transitions, 644 flow [2025-03-13 22:22:48,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:48,887 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 622 flow [2025-03-13 22:22:48,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-03-13 22:22:48,889 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -12 predicate places. [2025-03-13 22:22:48,889 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 622 flow [2025-03-13 22:22:48,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:48,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:48,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:22:48,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:48,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 501837218, now seen corresponding path program 1 times [2025-03-13 22:22:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:48,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164518544] [2025-03-13 22:22:48,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:48,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:22:48,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:22:48,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:48,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:48,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:48,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164518544] [2025-03-13 22:22:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164518544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:48,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733088297] [2025-03-13 22:22:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:48,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:48,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:48,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:48,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 344 [2025-03-13 22:22:48,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:48,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:48,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 344 [2025-03-13 22:22:48,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:49,017 INFO L124 PetriNetUnfolderBase]: 31/684 cut-off events. [2025-03-13 22:22:49,017 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:22:49,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 684 events. 31/684 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2985 event pairs, 5 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 589. Up to 25 conditions per place. [2025-03-13 22:22:49,021 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 10 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-03-13 22:22:49,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 308 transitions, 649 flow [2025-03-13 22:22:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2025-03-13 22:22:49,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525193798449613 [2025-03-13 22:22:49,023 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 622 flow. Second operand 3 states and 983 transitions. [2025-03-13 22:22:49,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 308 transitions, 649 flow [2025-03-13 22:22:49,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:49,030 INFO L231 Difference]: Finished difference. Result has 303 places, 307 transitions, 628 flow [2025-03-13 22:22:49,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=303, PETRI_TRANSITIONS=307} [2025-03-13 22:22:49,030 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -13 predicate places. [2025-03-13 22:22:49,030 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 307 transitions, 628 flow [2025-03-13 22:22:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:49,031 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] [2025-03-13 22:22:49,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:22:49,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:49,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:49,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1738497346, now seen corresponding path program 1 times [2025-03-13 22:22:49,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:49,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315097497] [2025-03-13 22:22:49,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:49,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:49,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:22:49,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:22:49,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:49,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315097497] [2025-03-13 22:22:49,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315097497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:49,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:49,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:49,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422083037] [2025-03-13 22:22:49,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:49,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:49,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:49,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:49,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 344 [2025-03-13 22:22:49,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 307 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:49,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 344 [2025-03-13 22:22:49,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:49,145 INFO L124 PetriNetUnfolderBase]: 32/662 cut-off events. [2025-03-13 22:22:49,145 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-13 22:22:49,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 662 events. 32/662 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3069 event pairs, 3 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 492. Up to 26 conditions per place. [2025-03-13 22:22:49,148 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 10 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-03-13 22:22:49,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 308 transitions, 655 flow [2025-03-13 22:22:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2025-03-13 22:22:49,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525193798449613 [2025-03-13 22:22:49,151 INFO L175 Difference]: Start difference. First operand has 303 places, 307 transitions, 628 flow. Second operand 3 states and 983 transitions. [2025-03-13 22:22:49,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 308 transitions, 655 flow [2025-03-13 22:22:49,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 308 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:49,157 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 638 flow [2025-03-13 22:22:49,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-03-13 22:22:49,158 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -12 predicate places. [2025-03-13 22:22:49,159 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 638 flow [2025-03-13 22:22:49,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:49,160 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] [2025-03-13 22:22:49,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:22:49,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:49,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1414838691, now seen corresponding path program 1 times [2025-03-13 22:22:49,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:49,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484736958] [2025-03-13 22:22:49,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:49,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-13 22:22:49,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 22:22:49,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:49,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:49,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484736958] [2025-03-13 22:22:49,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484736958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:49,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375236591] [2025-03-13 22:22:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:49,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:49,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:49,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:49,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 344 [2025-03-13 22:22:49,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:49,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 344 [2025-03-13 22:22:49,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:49,307 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2025-03-13 22:22:49,307 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-03-13 22:22:49,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 1050 events. 80/1050 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5562 event pairs, 12 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 950. Up to 94 conditions per place. [2025-03-13 22:22:49,312 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-03-13 22:22:49,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 308 transitions, 679 flow [2025-03-13 22:22:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-03-13 22:22:49,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428294573643411 [2025-03-13 22:22:49,317 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 638 flow. Second operand 3 states and 973 transitions. [2025-03-13 22:22:49,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 308 transitions, 679 flow [2025-03-13 22:22:49,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:49,320 INFO L231 Difference]: Finished difference. Result has 303 places, 305 transitions, 644 flow [2025-03-13 22:22:49,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=303, PETRI_TRANSITIONS=305} [2025-03-13 22:22:49,321 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -13 predicate places. [2025-03-13 22:22:49,321 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 305 transitions, 644 flow [2025-03-13 22:22:49,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:49,322 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] [2025-03-13 22:22:49,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:22:49,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:49,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1248365360, now seen corresponding path program 1 times [2025-03-13 22:22:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:49,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002231797] [2025-03-13 22:22:49,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:49,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 22:22:49,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 22:22:49,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:49,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002231797] [2025-03-13 22:22:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002231797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:49,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:49,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:49,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394063529] [2025-03-13 22:22:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:49,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:49,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:49,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:49,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 344 [2025-03-13 22:22:49,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 305 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:49,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 344 [2025-03-13 22:22:49,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:49,463 INFO L124 PetriNetUnfolderBase]: 87/1086 cut-off events. [2025-03-13 22:22:49,463 INFO L125 PetriNetUnfolderBase]: For 17/22 co-relation queries the response was YES. [2025-03-13 22:22:49,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 1086 events. 87/1086 cut-off events. For 17/22 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6019 event pairs, 13 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1016. Up to 100 conditions per place. [2025-03-13 22:22:49,469 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 16 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2025-03-13 22:22:49,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 306 transitions, 685 flow [2025-03-13 22:22:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-03-13 22:22:49,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428294573643411 [2025-03-13 22:22:49,471 INFO L175 Difference]: Start difference. First operand has 303 places, 305 transitions, 644 flow. Second operand 3 states and 973 transitions. [2025-03-13 22:22:49,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 306 transitions, 685 flow [2025-03-13 22:22:49,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 306 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:49,475 INFO L231 Difference]: Finished difference. Result has 302 places, 303 transitions, 650 flow [2025-03-13 22:22:49,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=302, PETRI_TRANSITIONS=303} [2025-03-13 22:22:49,476 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -14 predicate places. [2025-03-13 22:22:49,476 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 303 transitions, 650 flow [2025-03-13 22:22:49,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:49,477 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] [2025-03-13 22:22:49,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:22:49,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:49,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -572168096, now seen corresponding path program 1 times [2025-03-13 22:22:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:49,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305881105] [2025-03-13 22:22:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:49,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 22:22:49,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 22:22:49,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:49,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305881105] [2025-03-13 22:22:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305881105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:49,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:49,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:49,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851835584] [2025-03-13 22:22:49,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:49,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:22:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:49,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:22:49,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:22:49,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 344 [2025-03-13 22:22:49,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 303 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:49,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 344 [2025-03-13 22:22:49,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:49,731 INFO L124 PetriNetUnfolderBase]: 31/653 cut-off events. [2025-03-13 22:22:49,731 INFO L125 PetriNetUnfolderBase]: For 6/9 co-relation queries the response was YES. [2025-03-13 22:22:49,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 653 events. 31/653 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2625 event pairs, 0 based on Foata normal form. 2/594 useless extension candidates. Maximal degree in co-relation 524. Up to 14 conditions per place. [2025-03-13 22:22:49,734 INFO L140 encePairwiseOnDemand]: 330/344 looper letters, 12 selfloop transitions, 12 changer transitions 0/305 dead transitions. [2025-03-13 22:22:49,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 702 flow [2025-03-13 22:22:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:22:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:22:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1586 transitions. [2025-03-13 22:22:49,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.922093023255814 [2025-03-13 22:22:49,737 INFO L175 Difference]: Start difference. First operand has 302 places, 303 transitions, 650 flow. Second operand 5 states and 1586 transitions. [2025-03-13 22:22:49,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 702 flow [2025-03-13 22:22:49,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 702 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:49,740 INFO L231 Difference]: Finished difference. Result has 307 places, 305 transitions, 690 flow [2025-03-13 22:22:49,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=307, PETRI_TRANSITIONS=305} [2025-03-13 22:22:49,742 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -9 predicate places. [2025-03-13 22:22:49,743 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 690 flow [2025-03-13 22:22:49,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:49,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:49,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:49,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:22:49,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:49,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash -615326646, now seen corresponding path program 1 times [2025-03-13 22:22:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:49,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245209796] [2025-03-13 22:22:49,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:49,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-13 22:22:49,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-13 22:22:49,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:49,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:22:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245209796] [2025-03-13 22:22:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245209796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666038134] [2025-03-13 22:22:49,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:49,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:49,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:49,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:22:49,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:22:49,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-13 22:22:49,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-13 22:22:49,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:49,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:49,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 22:22:49,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:22:50,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:22:50,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666038134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:50,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:50,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-13 22:22:50,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861051821] [2025-03-13 22:22:50,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:50,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 22:22:50,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:50,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 22:22:50,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-13 22:22:50,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-03-13 22:22:50,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 690 flow. Second operand has 15 states, 15 states have (on average 308.6666666666667) internal successors, (4630), 15 states have internal predecessors, (4630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:50,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:50,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-03-13 22:22:50,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:50,840 INFO L124 PetriNetUnfolderBase]: 31/687 cut-off events. [2025-03-13 22:22:50,840 INFO L125 PetriNetUnfolderBase]: For 16/19 co-relation queries the response was YES. [2025-03-13 22:22:50,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 687 events. 31/687 cut-off events. For 16/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2575 event pairs, 0 based on Foata normal form. 4/630 useless extension candidates. Maximal degree in co-relation 598. Up to 14 conditions per place. [2025-03-13 22:22:50,845 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 20 selfloop transitions, 26 changer transitions 0/321 dead transitions. [2025-03-13 22:22:50,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 321 transitions, 818 flow [2025-03-13 22:22:50,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 22:22:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 22:22:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3416 transitions. [2025-03-13 22:22:50,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027484143763214 [2025-03-13 22:22:50,853 INFO L175 Difference]: Start difference. First operand has 307 places, 305 transitions, 690 flow. Second operand 11 states and 3416 transitions. [2025-03-13 22:22:50,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 321 transitions, 818 flow [2025-03-13 22:22:50,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 321 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:22:50,857 INFO L231 Difference]: Finished difference. Result has 317 places, 317 transitions, 790 flow [2025-03-13 22:22:50,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=790, PETRI_PLACES=317, PETRI_TRANSITIONS=317} [2025-03-13 22:22:50,858 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2025-03-13 22:22:50,858 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 317 transitions, 790 flow [2025-03-13 22:22:50,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 308.6666666666667) internal successors, (4630), 15 states have internal predecessors, (4630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:50,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:50,861 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:50,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 22:22:51,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-13 22:22:51,062 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:51,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -770481014, now seen corresponding path program 2 times [2025-03-13 22:22:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:51,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338681309] [2025-03-13 22:22:51,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:51,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-03-13 22:22:51,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 122 of 212 statements. [2025-03-13 22:22:51,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:22:51,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-13 22:22:51,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338681309] [2025-03-13 22:22:51,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338681309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:51,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:51,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701196865] [2025-03-13 22:22:51,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:51,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:51,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:51,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:51,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:51,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-03-13 22:22:51,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 317 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:51,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:51,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-03-13 22:22:51,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:51,814 INFO L124 PetriNetUnfolderBase]: 48/801 cut-off events. [2025-03-13 22:22:51,814 INFO L125 PetriNetUnfolderBase]: For 21/22 co-relation queries the response was YES. [2025-03-13 22:22:51,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 801 events. 48/801 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3578 event pairs, 2 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 821. Up to 48 conditions per place. [2025-03-13 22:22:51,817 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 27 selfloop transitions, 5 changer transitions 0/321 dead transitions. [2025-03-13 22:22:51,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 868 flow [2025-03-13 22:22:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions. [2025-03-13 22:22:51,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060077519379846 [2025-03-13 22:22:51,820 INFO L175 Difference]: Start difference. First operand has 317 places, 317 transitions, 790 flow. Second operand 6 states and 1870 transitions. [2025-03-13 22:22:51,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 868 flow [2025-03-13 22:22:51,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 844 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-13 22:22:51,826 INFO L231 Difference]: Finished difference. Result has 317 places, 315 transitions, 772 flow [2025-03-13 22:22:51,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=317, PETRI_TRANSITIONS=315} [2025-03-13 22:22:51,828 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2025-03-13 22:22:51,828 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 315 transitions, 772 flow [2025-03-13 22:22:51,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:51,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:51,830 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:51,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:22:51,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:51,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1119613251, now seen corresponding path program 1 times [2025-03-13 22:22:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:51,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501038222] [2025-03-13 22:22:51,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:51,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-13 22:22:51,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-13 22:22:51,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:51,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-13 22:22:52,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:52,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501038222] [2025-03-13 22:22:52,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501038222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:52,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003442767] [2025-03-13 22:22:52,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:52,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:52,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:52,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:22:52,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:22:52,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-13 22:22:52,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-13 22:22:52,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:52,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:52,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 22:22:52,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-13 22:22:52,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-13 22:22:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003442767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:52,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-13 22:22:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704073737] [2025-03-13 22:22:52,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 22:22:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:52,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 22:22:52,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-13 22:22:52,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-03-13 22:22:52,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 315 transitions, 772 flow. Second operand has 22 states, 22 states have (on average 308.59090909090907) internal successors, (6789), 22 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:52,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:52,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-03-13 22:22:52,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:53,254 INFO L124 PetriNetUnfolderBase]: 29/755 cut-off events. [2025-03-13 22:22:53,255 INFO L125 PetriNetUnfolderBase]: For 45/49 co-relation queries the response was YES. [2025-03-13 22:22:53,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 755 events. 29/755 cut-off events. For 45/49 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2686 event pairs, 0 based on Foata normal form. 4/705 useless extension candidates. Maximal degree in co-relation 706. Up to 19 conditions per place. [2025-03-13 22:22:53,258 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 24 selfloop transitions, 38 changer transitions 0/335 dead transitions. [2025-03-13 22:22:53,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 335 transitions, 992 flow [2025-03-13 22:22:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 22:22:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 22:22:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5268 transitions. [2025-03-13 22:22:53,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9008207934336525 [2025-03-13 22:22:53,266 INFO L175 Difference]: Start difference. First operand has 317 places, 315 transitions, 772 flow. Second operand 17 states and 5268 transitions. [2025-03-13 22:22:53,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 335 transitions, 992 flow [2025-03-13 22:22:53,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 335 transitions, 982 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:53,270 INFO L231 Difference]: Finished difference. Result has 331 places, 329 transitions, 946 flow [2025-03-13 22:22:53,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=946, PETRI_PLACES=331, PETRI_TRANSITIONS=329} [2025-03-13 22:22:53,271 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 15 predicate places. [2025-03-13 22:22:53,271 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 329 transitions, 946 flow [2025-03-13 22:22:53,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 308.59090909090907) internal successors, (6789), 22 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:53,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:53,273 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:53,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 22:22:53,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 22:22:53,474 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:53,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2038249213, now seen corresponding path program 2 times [2025-03-13 22:22:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863226457] [2025-03-13 22:22:53,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:53,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-13 22:22:53,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 278 statements. [2025-03-13 22:22:53,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:22:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-13 22:22:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863226457] [2025-03-13 22:22:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863226457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:53,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370334658] [2025-03-13 22:22:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:53,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:53,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:53,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:54,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-03-13 22:22:54,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 329 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:54,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:54,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-03-13 22:22:54,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:54,224 INFO L124 PetriNetUnfolderBase]: 61/838 cut-off events. [2025-03-13 22:22:54,224 INFO L125 PetriNetUnfolderBase]: For 87/89 co-relation queries the response was YES. [2025-03-13 22:22:54,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 838 events. 61/838 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3597 event pairs, 3 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 781. Up to 64 conditions per place. [2025-03-13 22:22:54,229 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 26 selfloop transitions, 5 changer transitions 0/332 dead transitions. [2025-03-13 22:22:54,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 332 transitions, 1019 flow [2025-03-13 22:22:54,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1869 transitions. [2025-03-13 22:22:54,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055232558139535 [2025-03-13 22:22:54,232 INFO L175 Difference]: Start difference. First operand has 331 places, 329 transitions, 946 flow. Second operand 6 states and 1869 transitions. [2025-03-13 22:22:54,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 332 transitions, 1019 flow [2025-03-13 22:22:54,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 332 transitions, 967 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-13 22:22:54,237 INFO L231 Difference]: Finished difference. Result has 326 places, 327 transitions, 900 flow [2025-03-13 22:22:54,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=326, PETRI_TRANSITIONS=327} [2025-03-13 22:22:54,238 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 10 predicate places. [2025-03-13 22:22:54,238 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 327 transitions, 900 flow [2025-03-13 22:22:54,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:54,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:54,239 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:54,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:22:54,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:54,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash 935197614, now seen corresponding path program 1 times [2025-03-13 22:22:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:54,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825098997] [2025-03-13 22:22:54,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:54,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-13 22:22:54,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-13 22:22:54,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:54,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-13 22:22:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825098997] [2025-03-13 22:22:54,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825098997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:54,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:54,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:54,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992325993] [2025-03-13 22:22:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:54,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:54,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:54,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:55,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-03-13 22:22:55,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 327 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:55,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:55,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-03-13 22:22:55,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:55,355 INFO L124 PetriNetUnfolderBase]: 41/860 cut-off events. [2025-03-13 22:22:55,355 INFO L125 PetriNetUnfolderBase]: For 66/68 co-relation queries the response was YES. [2025-03-13 22:22:55,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 860 events. 41/860 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3524 event pairs, 2 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 925. Up to 64 conditions per place. [2025-03-13 22:22:55,360 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 27 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2025-03-13 22:22:55,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 331 transitions, 978 flow [2025-03-13 22:22:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions. [2025-03-13 22:22:55,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060077519379846 [2025-03-13 22:22:55,364 INFO L175 Difference]: Start difference. First operand has 326 places, 327 transitions, 900 flow. Second operand 6 states and 1870 transitions. [2025-03-13 22:22:55,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 331 transitions, 978 flow [2025-03-13 22:22:55,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 331 transitions, 968 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:55,369 INFO L231 Difference]: Finished difference. Result has 324 places, 325 transitions, 896 flow [2025-03-13 22:22:55,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=324, PETRI_TRANSITIONS=325} [2025-03-13 22:22:55,370 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 8 predicate places. [2025-03-13 22:22:55,370 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 325 transitions, 896 flow [2025-03-13 22:22:55,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:55,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:55,371 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:55,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:22:55,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:55,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -127587231, now seen corresponding path program 1 times [2025-03-13 22:22:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:55,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167698192] [2025-03-13 22:22:55,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:55,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:55,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-13 22:22:55,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-13 22:22:55,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:55,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-13 22:22:55,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167698192] [2025-03-13 22:22:55,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167698192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:55,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:55,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:55,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616526516] [2025-03-13 22:22:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:55,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:55,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:55,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:55,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:56,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-03-13 22:22:56,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 325 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-03-13 22:22:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,306 INFO L124 PetriNetUnfolderBase]: 68/893 cut-off events. [2025-03-13 22:22:56,306 INFO L125 PetriNetUnfolderBase]: For 103/106 co-relation queries the response was YES. [2025-03-13 22:22:56,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 893 events. 68/893 cut-off events. For 103/106 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3945 event pairs, 5 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 864. Up to 73 conditions per place. [2025-03-13 22:22:56,311 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 26 selfloop transitions, 5 changer transitions 0/328 dead transitions. [2025-03-13 22:22:56,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 328 transitions, 969 flow [2025-03-13 22:22:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1869 transitions. [2025-03-13 22:22:56,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055232558139535 [2025-03-13 22:22:56,315 INFO L175 Difference]: Start difference. First operand has 324 places, 325 transitions, 896 flow. Second operand 6 states and 1869 transitions. [2025-03-13 22:22:56,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 328 transitions, 969 flow [2025-03-13 22:22:56,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 328 transitions, 959 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:56,320 INFO L231 Difference]: Finished difference. Result has 322 places, 323 transitions, 892 flow [2025-03-13 22:22:56,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=322, PETRI_TRANSITIONS=323} [2025-03-13 22:22:56,322 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 6 predicate places. [2025-03-13 22:22:56,322 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 323 transitions, 892 flow [2025-03-13 22:22:56,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,323 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:56,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:22:56,323 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:56,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash 332448859, now seen corresponding path program 1 times [2025-03-13 22:22:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536593294] [2025-03-13 22:22:56,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-13 22:22:56,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-13 22:22:56,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-13 22:22:56,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536593294] [2025-03-13 22:22:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536593294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83878728] [2025-03-13 22:22:56,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 344 [2025-03-13 22:22:56,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 323 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 344 [2025-03-13 22:22:56,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,485 INFO L124 PetriNetUnfolderBase]: 34/746 cut-off events. [2025-03-13 22:22:56,485 INFO L125 PetriNetUnfolderBase]: For 63/66 co-relation queries the response was YES. [2025-03-13 22:22:56,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 746 events. 34/746 cut-off events. For 63/66 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2630 event pairs, 2 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 754. Up to 27 conditions per place. [2025-03-13 22:22:56,489 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 8 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-03-13 22:22:56,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 913 flow [2025-03-13 22:22:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2025-03-13 22:22:56,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525193798449613 [2025-03-13 22:22:56,491 INFO L175 Difference]: Start difference. First operand has 322 places, 323 transitions, 892 flow. Second operand 3 states and 983 transitions. [2025-03-13 22:22:56,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 913 flow [2025-03-13 22:22:56,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 323 transitions, 903 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:56,497 INFO L231 Difference]: Finished difference. Result has 318 places, 322 transitions, 884 flow [2025-03-13 22:22:56,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=318, PETRI_TRANSITIONS=322} [2025-03-13 22:22:56,498 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 2 predicate places. [2025-03-13 22:22:56,499 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 322 transitions, 884 flow [2025-03-13 22:22:56,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,499 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:56,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:22:56,499 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:56,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1977853146, now seen corresponding path program 1 times [2025-03-13 22:22:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308952256] [2025-03-13 22:22:56,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-13 22:22:56,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-13 22:22:56,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-13 22:22:56,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308952256] [2025-03-13 22:22:56,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308952256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141452673] [2025-03-13 22:22:56,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 344 [2025-03-13 22:22:56,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 322 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 344 [2025-03-13 22:22:56,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,672 INFO L124 PetriNetUnfolderBase]: 33/723 cut-off events. [2025-03-13 22:22:56,672 INFO L125 PetriNetUnfolderBase]: For 66/68 co-relation queries the response was YES. [2025-03-13 22:22:56,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 723 events. 33/723 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2399 event pairs, 1 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 861. Up to 17 conditions per place. [2025-03-13 22:22:56,675 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 6 selfloop transitions, 1 changer transitions 0/321 dead transitions. [2025-03-13 22:22:56,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 321 transitions, 896 flow [2025-03-13 22:22:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 986 transitions. [2025-03-13 22:22:56,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9554263565891473 [2025-03-13 22:22:56,678 INFO L175 Difference]: Start difference. First operand has 318 places, 322 transitions, 884 flow. Second operand 3 states and 986 transitions. [2025-03-13 22:22:56,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 321 transitions, 896 flow [2025-03-13 22:22:56,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:56,681 INFO L231 Difference]: Finished difference. Result has 317 places, 321 transitions, 880 flow [2025-03-13 22:22:56,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=317, PETRI_TRANSITIONS=321} [2025-03-13 22:22:56,682 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2025-03-13 22:22:56,682 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 321 transitions, 880 flow [2025-03-13 22:22:56,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,683 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:56,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:22:56,683 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:56,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1953624156, now seen corresponding path program 1 times [2025-03-13 22:22:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422431412] [2025-03-13 22:22:56,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-13 22:22:56,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-13 22:22:56,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-13 22:22:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422431412] [2025-03-13 22:22:56,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422431412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189062727] [2025-03-13 22:22:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 344 [2025-03-13 22:22:56,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 321 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 344 [2025-03-13 22:22:56,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,818 INFO L124 PetriNetUnfolderBase]: 33/716 cut-off events. [2025-03-13 22:22:56,819 INFO L125 PetriNetUnfolderBase]: For 63/65 co-relation queries the response was YES. [2025-03-13 22:22:56,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 716 events. 33/716 cut-off events. For 63/65 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2376 event pairs, 1 based on Foata normal form. 2/687 useless extension candidates. Maximal degree in co-relation 889. Up to 18 conditions per place. [2025-03-13 22:22:56,822 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 4 selfloop transitions, 0 changer transitions 4/320 dead transitions. [2025-03-13 22:22:56,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 320 transitions, 890 flow [2025-03-13 22:22:56,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2025-03-13 22:22:56,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544573643410853 [2025-03-13 22:22:56,824 INFO L175 Difference]: Start difference. First operand has 317 places, 321 transitions, 880 flow. Second operand 3 states and 985 transitions. [2025-03-13 22:22:56,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 320 transitions, 890 flow [2025-03-13 22:22:56,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 320 transitions, 889 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:22:56,828 INFO L231 Difference]: Finished difference. Result has 317 places, 316 transitions, 867 flow [2025-03-13 22:22:56,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=867, PETRI_PLACES=317, PETRI_TRANSITIONS=316} [2025-03-13 22:22:56,829 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2025-03-13 22:22:56,829 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 316 transitions, 867 flow [2025-03-13 22:22:56,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:56,829 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:56,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:22:56,830 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 22:22:56,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 614891675, now seen corresponding path program 1 times [2025-03-13 22:22:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764247628] [2025-03-13 22:22:56,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:56,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-13 22:22:56,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-13 22:22:56,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:56,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-13 22:22:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764247628] [2025-03-13 22:22:56,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764247628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:56,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:56,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:22:56,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575312858] [2025-03-13 22:22:56,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:56,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:56,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:56,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:56,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:56,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 344 [2025-03-13 22:22:56,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 316 transitions, 867 flow. Second operand has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:56,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 344 [2025-03-13 22:22:56,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:56,964 INFO L124 PetriNetUnfolderBase]: 38/715 cut-off events. [2025-03-13 22:22:56,965 INFO L125 PetriNetUnfolderBase]: For 69/71 co-relation queries the response was YES. [2025-03-13 22:22:56,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 715 events. 38/715 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2334 event pairs, 2 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 909. Up to 21 conditions per place. [2025-03-13 22:22:56,968 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 0 selfloop transitions, 0 changer transitions 316/316 dead transitions. [2025-03-13 22:22:56,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 316 transitions, 884 flow [2025-03-13 22:22:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2025-03-13 22:22:56,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9505813953488372 [2025-03-13 22:22:56,970 INFO L175 Difference]: Start difference. First operand has 317 places, 316 transitions, 867 flow. Second operand 3 states and 981 transitions. [2025-03-13 22:22:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 316 transitions, 884 flow [2025-03-13 22:22:56,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 316 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:56,973 INFO L231 Difference]: Finished difference. Result has 312 places, 0 transitions, 0 flow [2025-03-13 22:22:56,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=312, PETRI_TRANSITIONS=0} [2025-03-13 22:22:56,974 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -4 predicate places. [2025-03-13 22:22:56,974 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 0 transitions, 0 flow [2025-03-13 22:22:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:56,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2025-03-13 22:22:56,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-03-13 22:22:56,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-03-13 22:22:56,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-03-13 22:22:56,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2025-03-13 22:22:56,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-03-13 22:22:56,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-03-13 22:22:56,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:22:56,986 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:22:56,991 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:22:56,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:22:56,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:22:56 BasicIcfg [2025-03-13 22:22:56,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:22:56,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:22:56,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:22:56,998 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:22:56,999 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:22:46" (3/4) ... [2025-03-13 22:22:57,000 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:22:57,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:22:57,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:22:57,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-13 22:22:57,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:22:57,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:22:57,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:22:57,074 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:22:57,075 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:22:57,075 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:22:57,075 INFO L158 Benchmark]: Toolchain (without parser) took 11220.47ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 105.6MB in the beginning and 144.7MB in the end (delta: -39.0MB). Peak memory consumption was 242.8MB. Max. memory is 16.1GB. [2025-03-13 22:22:57,076 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:22:57,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.11ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 92.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:22:57,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.89ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:22:57,077 INFO L158 Benchmark]: Boogie Preprocessor took 28.40ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 87.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:22:57,077 INFO L158 Benchmark]: IcfgBuilder took 538.13ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 58.2MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 22:22:57,078 INFO L158 Benchmark]: TraceAbstraction took 10370.29ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 57.2MB in the beginning and 153.0MB in the end (delta: -95.8MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. [2025-03-13 22:22:57,078 INFO L158 Benchmark]: Witness Printer took 76.84ms. Allocated memory is still 427.8MB. Free memory was 153.0MB in the beginning and 144.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:22:57,079 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.11ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 92.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.89ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.40ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 87.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 538.13ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 58.2MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10370.29ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 57.2MB in the beginning and 153.0MB in the end (delta: -95.8MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. * Witness Printer took 76.84ms. Allocated memory is still 427.8MB. Free memory was 153.0MB in the beginning and 144.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 488 locations, 54 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: 10.2s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2545 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1622 mSDsluCounter, 1047 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 814 mSDsCounter, 586 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4316 IncrementalHoareTripleChecker+Invalid, 4902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 586 mSolverCounterUnsat, 233 mSDtfsCounter, 4316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 740 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=13, InterpolantAutomatonStates: 99, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3904 NumberOfCodeBlocks, 3664 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4250 ConstructedInterpolants, 0 QuantifiedInterpolants, 6037 SizeOfPredicates, 14 NumberOfNonLiveVariables, 840 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 2416/2563 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:22:57,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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