./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:22:00,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:22:00,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:22:00,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:22:00,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:22:00,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:22:00,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:22:00,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:22:00,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:22:00,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:22:00,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:22:00,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:22:00,325 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:22:00,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:22:00,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:22:00,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:22:00,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:22:00,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:22:00,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:22:00,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:22:00,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:22:00,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:22:00,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:22:00,328 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa [2025-02-06 09:22:00,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:22:00,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:22:00,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:22:00,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:22:00,589 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:22:00,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-02-06 09:22:02,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c336a37d8/9bfeba0c20b8491caf38fdf75ab46b17/FLAG8f49e999f [2025-02-06 09:22:02,739 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:22:02,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-02-06 09:22:02,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c336a37d8/9bfeba0c20b8491caf38fdf75ab46b17/FLAG8f49e999f [2025-02-06 09:22:03,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c336a37d8/9bfeba0c20b8491caf38fdf75ab46b17 [2025-02-06 09:22:03,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:22:03,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:22:03,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:22:03,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:22:03,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:22:03,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a630b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03, skipping insertion in model container [2025-02-06 09:22:03,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:22:03,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:22:03,468 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:22:03,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:22:03,552 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:22:03,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03 WrapperNode [2025-02-06 09:22:03,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:22:03,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:22:03,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:22:03,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:22:03,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,598 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 242 [2025-02-06 09:22:03,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:22:03,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:22:03,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:22:03,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:22:03,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:22:03,629 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:22:03,629 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:22:03,629 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:22:03,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (1/1) ... [2025-02-06 09:22:03,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:22:03,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:03,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:22:03,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:22:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:22:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:22:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:22:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:22:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:22:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:22:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:22:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:22:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:22:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:22:03,690 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:22:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:22:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:22:03,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:22:03,691 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:22:03,813 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:22:03,814 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:22:04,276 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:22:04,276 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:22:04,300 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:22:04,301 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:22:04,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:04 BoogieIcfgContainer [2025-02-06 09:22:04,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:22:04,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:22:04,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:22:04,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:22:04,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:22:03" (1/3) ... [2025-02-06 09:22:04,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba1159b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:22:04, skipping insertion in model container [2025-02-06 09:22:04,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:03" (2/3) ... [2025-02-06 09:22:04,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba1159b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:22:04, skipping insertion in model container [2025-02-06 09:22:04,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:04" (3/3) ... [2025-02-06 09:22:04,310 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2025-02-06 09:22:04,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:22:04,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist.i that has 2 procedures, 284 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-02-06 09:22:04,325 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:22:04,400 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:22:04,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 286 transitions, 576 flow [2025-02-06 09:22:04,519 INFO L124 PetriNetUnfolderBase]: 3/285 cut-off events. [2025-02-06 09:22:04,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:04,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 285 events. 3/285 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 407 event pairs, 0 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 157. Up to 2 conditions per place. [2025-02-06 09:22:04,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 287 places, 286 transitions, 576 flow [2025-02-06 09:22:04,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 285 transitions, 573 flow [2025-02-06 09:22:04,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:22:04,555 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;@1dd99155, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:22:04,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-06 09:22:04,572 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:22:04,573 INFO L124 PetriNetUnfolderBase]: 1/75 cut-off events. [2025-02-06 09:22:04,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:04,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:04,574 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] [2025-02-06 09:22:04,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash 201734489, now seen corresponding path program 1 times [2025-02-06 09:22:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:04,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813324006] [2025-02-06 09:22:04,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 09:22:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 09:22:04,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:04,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813324006] [2025-02-06 09:22:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813324006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:05,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:05,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363871951] [2025-02-06 09:22:05,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:05,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:05,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:05,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:05,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:05,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 286 [2025-02-06 09:22:05,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 285 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:05,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:05,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 286 [2025-02-06 09:22:05,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:05,930 INFO L124 PetriNetUnfolderBase]: 365/1634 cut-off events. [2025-02-06 09:22:05,930 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:22:05,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1634 events. 365/1634 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10047 event pairs, 364 based on Foata normal form. 11/1518 useless extension candidates. Maximal degree in co-relation 2247. Up to 800 conditions per place. [2025-02-06 09:22:05,939 INFO L140 encePairwiseOnDemand]: 272/286 looper letters, 71 selfloop transitions, 10 changer transitions 1/281 dead transitions. [2025-02-06 09:22:05,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 281 transitions, 727 flow [2025-02-06 09:22:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-02-06 09:22:05,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7523310023310024 [2025-02-06 09:22:05,952 INFO L175 Difference]: Start difference. First operand has 286 places, 285 transitions, 573 flow. Second operand 6 states and 1291 transitions. [2025-02-06 09:22:05,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 281 transitions, 727 flow [2025-02-06 09:22:05,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 281 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:05,960 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 582 flow [2025-02-06 09:22:05,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=288, PETRI_TRANSITIONS=280} [2025-02-06 09:22:05,965 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-02-06 09:22:05,965 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 582 flow [2025-02-06 09:22:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:05,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:05,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:05,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:22:05,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:05,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash -134879796, now seen corresponding path program 1 times [2025-02-06 09:22:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:05,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59868062] [2025-02-06 09:22:05,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:05,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:05,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:22:05,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:22:05,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:05,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:06,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:06,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59868062] [2025-02-06 09:22:06,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59868062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:06,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:22:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632023107] [2025-02-06 09:22:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:22:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:22:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:22:06,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 286 [2025-02-06 09:22:06,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 280 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:06,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:06,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 286 [2025-02-06 09:22:06,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:06,117 INFO L124 PetriNetUnfolderBase]: 7/467 cut-off events. [2025-02-06 09:22:06,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:06,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 467 events. 7/467 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 873 event pairs, 6 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 299. Up to 24 conditions per place. [2025-02-06 09:22:06,120 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 10 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-02-06 09:22:06,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 281 transitions, 608 flow [2025-02-06 09:22:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:22:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:22:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 832 transitions. [2025-02-06 09:22:06,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-02-06 09:22:06,121 INFO L175 Difference]: Start difference. First operand has 288 places, 280 transitions, 582 flow. Second operand 3 states and 832 transitions. [2025-02-06 09:22:06,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 281 transitions, 608 flow [2025-02-06 09:22:06,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:06,128 INFO L231 Difference]: Finished difference. Result has 285 places, 281 transitions, 574 flow [2025-02-06 09:22:06,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=285, PETRI_TRANSITIONS=281} [2025-02-06 09:22:06,129 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -1 predicate places. [2025-02-06 09:22:06,129 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 281 transitions, 574 flow [2025-02-06 09:22:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:06,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:06,130 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] [2025-02-06 09:22:06,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:22:06,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:06,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 457912700, now seen corresponding path program 1 times [2025-02-06 09:22:06,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306102037] [2025-02-06 09:22:06,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:06,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:22:06,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:22:06,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:06,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:06,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:06,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306102037] [2025-02-06 09:22:06,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306102037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:06,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:06,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231223327] [2025-02-06 09:22:06,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:06,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:06,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:06,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:06,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 286 [2025-02-06 09:22:06,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 281 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:06,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:06,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 286 [2025-02-06 09:22:06,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:07,072 INFO L124 PetriNetUnfolderBase]: 365/1740 cut-off events. [2025-02-06 09:22:07,072 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:22:07,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2600 conditions, 1740 events. 365/1740 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9974 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2408. Up to 830 conditions per place. [2025-02-06 09:22:07,077 INFO L140 encePairwiseOnDemand]: 274/286 looper letters, 71 selfloop transitions, 10 changer transitions 0/279 dead transitions. [2025-02-06 09:22:07,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 279 transitions, 732 flow [2025-02-06 09:22:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1289 transitions. [2025-02-06 09:22:07,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511655011655012 [2025-02-06 09:22:07,080 INFO L175 Difference]: Start difference. First operand has 285 places, 281 transitions, 574 flow. Second operand 6 states and 1289 transitions. [2025-02-06 09:22:07,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 279 transitions, 732 flow [2025-02-06 09:22:07,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 279 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:07,083 INFO L231 Difference]: Finished difference. Result has 287 places, 279 transitions, 588 flow [2025-02-06 09:22:07,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=287, PETRI_TRANSITIONS=279} [2025-02-06 09:22:07,084 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 1 predicate places. [2025-02-06 09:22:07,084 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 279 transitions, 588 flow [2025-02-06 09:22:07,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:07,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:07,085 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] [2025-02-06 09:22:07,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:22:07,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:07,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash -976369191, now seen corresponding path program 1 times [2025-02-06 09:22:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077082338] [2025-02-06 09:22:07,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:07,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:22:07,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:22:07,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:07,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:07,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:07,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077082338] [2025-02-06 09:22:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077082338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:07,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:07,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658140029] [2025-02-06 09:22:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:07,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:07,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:07,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:07,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 286 [2025-02-06 09:22:07,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 279 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:07,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:07,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 286 [2025-02-06 09:22:07,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:08,109 INFO L124 PetriNetUnfolderBase]: 391/1828 cut-off events. [2025-02-06 09:22:08,109 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:22:08,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1828 events. 391/1828 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10762 event pairs, 390 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2491. Up to 899 conditions per place. [2025-02-06 09:22:08,116 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 83 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2025-02-06 09:22:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 278 transitions, 762 flow [2025-02-06 09:22:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1264 transitions. [2025-02-06 09:22:08,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7365967365967366 [2025-02-06 09:22:08,119 INFO L175 Difference]: Start difference. First operand has 287 places, 279 transitions, 588 flow. Second operand 6 states and 1264 transitions. [2025-02-06 09:22:08,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 278 transitions, 762 flow [2025-02-06 09:22:08,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 278 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:08,122 INFO L231 Difference]: Finished difference. Result has 286 places, 278 transitions, 576 flow [2025-02-06 09:22:08,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=286, PETRI_TRANSITIONS=278} [2025-02-06 09:22:08,124 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2025-02-06 09:22:08,124 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 278 transitions, 576 flow [2025-02-06 09:22:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:08,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:08,125 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] [2025-02-06 09:22:08,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:22:08,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:08,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1930103438, now seen corresponding path program 1 times [2025-02-06 09:22:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567352691] [2025-02-06 09:22:08,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:08,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:22:08,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:22:08,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:08,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:08,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:08,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567352691] [2025-02-06 09:22:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567352691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:08,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:08,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752942184] [2025-02-06 09:22:08,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:08,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:08,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:08,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:09,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 286 [2025-02-06 09:22:09,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 278 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:09,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:09,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 286 [2025-02-06 09:22:09,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:09,136 INFO L124 PetriNetUnfolderBase]: 55/702 cut-off events. [2025-02-06 09:22:09,137 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:22:09,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 702 events. 55/702 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2667 event pairs, 54 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 717. Up to 195 conditions per place. [2025-02-06 09:22:09,152 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 57 selfloop transitions, 5 changer transitions 0/277 dead transitions. [2025-02-06 09:22:09,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 277 transitions, 698 flow [2025-02-06 09:22:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2025-02-06 09:22:09,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8123543123543123 [2025-02-06 09:22:09,155 INFO L175 Difference]: Start difference. First operand has 286 places, 278 transitions, 576 flow. Second operand 6 states and 1394 transitions. [2025-02-06 09:22:09,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 277 transitions, 698 flow [2025-02-06 09:22:09,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 277 transitions, 688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:09,160 INFO L231 Difference]: Finished difference. Result has 285 places, 277 transitions, 574 flow [2025-02-06 09:22:09,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=574, PETRI_PLACES=285, PETRI_TRANSITIONS=277} [2025-02-06 09:22:09,162 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -1 predicate places. [2025-02-06 09:22:09,163 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 277 transitions, 574 flow [2025-02-06 09:22:09,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:09,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:09,164 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-02-06 09:22:09,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:22:09,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:09,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2069327791, now seen corresponding path program 1 times [2025-02-06 09:22:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:09,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696552679] [2025-02-06 09:22:09,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:09,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 09:22:09,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 09:22:09,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:09,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:09,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:09,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696552679] [2025-02-06 09:22:09,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696552679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:09,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:09,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:09,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351697676] [2025-02-06 09:22:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:09,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:09,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:09,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:09,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:09,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-02-06 09:22:09,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 277 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:09,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:09,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-02-06 09:22:09,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:09,973 INFO L124 PetriNetUnfolderBase]: 37/617 cut-off events. [2025-02-06 09:22:09,973 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:22:09,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 617 events. 37/617 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2090 event pairs, 36 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 581. Up to 158 conditions per place. [2025-02-06 09:22:09,975 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 53 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2025-02-06 09:22:09,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 276 transitions, 688 flow [2025-02-06 09:22:09,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2025-02-06 09:22:09,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2025-02-06 09:22:09,977 INFO L175 Difference]: Start difference. First operand has 285 places, 277 transitions, 574 flow. Second operand 6 states and 1409 transitions. [2025-02-06 09:22:09,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 276 transitions, 688 flow [2025-02-06 09:22:09,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 276 transitions, 678 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:09,980 INFO L231 Difference]: Finished difference. Result has 284 places, 276 transitions, 572 flow [2025-02-06 09:22:09,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=284, PETRI_TRANSITIONS=276} [2025-02-06 09:22:09,981 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -2 predicate places. [2025-02-06 09:22:09,981 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 276 transitions, 572 flow [2025-02-06 09:22:09,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:09,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:09,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:09,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:22:09,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:09,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1615578824, now seen corresponding path program 1 times [2025-02-06 09:22:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525503517] [2025-02-06 09:22:09,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:09,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 09:22:10,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 09:22:10,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:10,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:22:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525503517] [2025-02-06 09:22:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525503517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121486471] [2025-02-06 09:22:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:10,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:10,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 286 [2025-02-06 09:22:10,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 276 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:10,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:10,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 286 [2025-02-06 09:22:10,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:10,753 INFO L124 PetriNetUnfolderBase]: 365/1732 cut-off events. [2025-02-06 09:22:10,753 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:22:10,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1732 events. 365/1732 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9958 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2390. Up to 846 conditions per place. [2025-02-06 09:22:10,759 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 79 selfloop transitions, 5 changer transitions 0/275 dead transitions. [2025-02-06 09:22:10,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 275 transitions, 738 flow [2025-02-06 09:22:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-02-06 09:22:10,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7453379953379954 [2025-02-06 09:22:10,762 INFO L175 Difference]: Start difference. First operand has 284 places, 276 transitions, 572 flow. Second operand 6 states and 1279 transitions. [2025-02-06 09:22:10,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 275 transitions, 738 flow [2025-02-06 09:22:10,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 275 transitions, 728 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:10,765 INFO L231 Difference]: Finished difference. Result has 283 places, 275 transitions, 570 flow [2025-02-06 09:22:10,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=283, PETRI_TRANSITIONS=275} [2025-02-06 09:22:10,767 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -3 predicate places. [2025-02-06 09:22:10,767 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 275 transitions, 570 flow [2025-02-06 09:22:10,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:10,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:10,768 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] [2025-02-06 09:22:10,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:22:10,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:10,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1189061414, now seen corresponding path program 1 times [2025-02-06 09:22:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183264990] [2025-02-06 09:22:10,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:10,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 09:22:10,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 09:22:10,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:10,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:22:11,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:11,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183264990] [2025-02-06 09:22:11,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183264990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:11,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:11,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:11,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655456921] [2025-02-06 09:22:11,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:11,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:11,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:11,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:11,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:11,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 286 [2025-02-06 09:22:11,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 275 transitions, 570 flow. Second operand has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:11,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:11,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 286 [2025-02-06 09:22:11,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:11,544 INFO L124 PetriNetUnfolderBase]: 365/1730 cut-off events. [2025-02-06 09:22:11,544 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:22:11,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 1730 events. 365/1730 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9919 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2395. Up to 844 conditions per place. [2025-02-06 09:22:11,550 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 78 selfloop transitions, 5 changer transitions 0/274 dead transitions. [2025-02-06 09:22:11,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 274 transitions, 734 flow [2025-02-06 09:22:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-02-06 09:22:11,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7482517482517482 [2025-02-06 09:22:11,553 INFO L175 Difference]: Start difference. First operand has 283 places, 275 transitions, 570 flow. Second operand 6 states and 1284 transitions. [2025-02-06 09:22:11,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 274 transitions, 734 flow [2025-02-06 09:22:11,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 274 transitions, 724 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:11,556 INFO L231 Difference]: Finished difference. Result has 282 places, 274 transitions, 568 flow [2025-02-06 09:22:11,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=282, PETRI_TRANSITIONS=274} [2025-02-06 09:22:11,557 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -4 predicate places. [2025-02-06 09:22:11,557 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 274 transitions, 568 flow [2025-02-06 09:22:11,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:11,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:11,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:11,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:22:11,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:11,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:11,559 INFO L85 PathProgramCache]: Analyzing trace with hash 141307069, now seen corresponding path program 1 times [2025-02-06 09:22:11,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:11,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462097685] [2025-02-06 09:22:11,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:11,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 09:22:11,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 09:22:11,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:11,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:22:11,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:11,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462097685] [2025-02-06 09:22:11,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462097685] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:11,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393839648] [2025-02-06 09:22:11,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:11,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:11,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:11,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:22:11,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:22:11,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 09:22:11,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 09:22:11,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:11,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:11,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:22:11,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:22:12,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:22:12,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393839648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:12,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:22:12,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64617980] [2025-02-06 09:22:12,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:12,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:22:12,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:12,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:22:12,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:22:12,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-02-06 09:22:12,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 274 transitions, 568 flow. Second operand has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:12,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:12,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-02-06 09:22:12,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:12,366 INFO L124 PetriNetUnfolderBase]: 7/560 cut-off events. [2025-02-06 09:22:12,367 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:22:12,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 560 events. 7/560 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 397 event pairs, 6 based on Foata normal form. 2/542 useless extension candidates. Maximal degree in co-relation 244. Up to 24 conditions per place. [2025-02-06 09:22:12,368 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 14 selfloop transitions, 9 changer transitions 0/282 dead transitions. [2025-02-06 09:22:12,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 282 transitions, 632 flow [2025-02-06 09:22:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:22:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:22:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2455 transitions. [2025-02-06 09:22:12,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9537684537684538 [2025-02-06 09:22:12,372 INFO L175 Difference]: Start difference. First operand has 282 places, 274 transitions, 568 flow. Second operand 9 states and 2455 transitions. [2025-02-06 09:22:12,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 282 transitions, 632 flow [2025-02-06 09:22:12,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 282 transitions, 622 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:12,378 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 608 flow [2025-02-06 09:22:12,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=608, PETRI_PLACES=288, PETRI_TRANSITIONS=280} [2025-02-06 09:22:12,379 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-02-06 09:22:12,379 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 608 flow [2025-02-06 09:22:12,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:12,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:12,381 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, 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, 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, 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] [2025-02-06 09:22:12,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:22:12,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:12,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:12,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash 44524957, now seen corresponding path program 2 times [2025-02-06 09:22:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:12,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445879104] [2025-02-06 09:22:12,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:12,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 367 statements into 2 equivalence classes. [2025-02-06 09:22:12,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 52 of 367 statements. [2025-02-06 09:22:12,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:12,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2025-02-06 09:22:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445879104] [2025-02-06 09:22:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445879104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816690706] [2025-02-06 09:22:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:12,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:12,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:13,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-02-06 09:22:13,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 280 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:13,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:13,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-02-06 09:22:13,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:13,627 INFO L124 PetriNetUnfolderBase]: 257/1877 cut-off events. [2025-02-06 09:22:13,628 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:22:13,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 1877 events. 257/1877 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10104 event pairs, 36 based on Foata normal form. 0/1751 useless extension candidates. Maximal degree in co-relation 2076. Up to 491 conditions per place. [2025-02-06 09:22:13,635 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 67 selfloop transitions, 70 changer transitions 0/358 dead transitions. [2025-02-06 09:22:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 358 transitions, 1038 flow [2025-02-06 09:22:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2025-02-06 09:22:13,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-02-06 09:22:13,638 INFO L175 Difference]: Start difference. First operand has 288 places, 280 transitions, 608 flow. Second operand 6 states and 1488 transitions. [2025-02-06 09:22:13,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 358 transitions, 1038 flow [2025-02-06 09:22:13,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 358 transitions, 1032 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:13,644 INFO L231 Difference]: Finished difference. Result has 297 places, 349 transitions, 1064 flow [2025-02-06 09:22:13,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=297, PETRI_TRANSITIONS=349} [2025-02-06 09:22:13,645 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 11 predicate places. [2025-02-06 09:22:13,646 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 349 transitions, 1064 flow [2025-02-06 09:22:13,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:13,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:13,647 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, 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, 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, 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] [2025-02-06 09:22:13,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:22:13,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:13,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash 904729825, now seen corresponding path program 1 times [2025-02-06 09:22:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42292360] [2025-02-06 09:22:13,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:13,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-06 09:22:13,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 09:22:13,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:13,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-06 09:22:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42292360] [2025-02-06 09:22:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42292360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520171194] [2025-02-06 09:22:14,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:14,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:14,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:22:14,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:22:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-06 09:22:14,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 09:22:14,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:14,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:14,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:22:14,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-06 09:22:14,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-06 09:22:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520171194] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:15,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:22:15,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000276127] [2025-02-06 09:22:15,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:22:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:15,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:22:15,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:22:15,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-02-06 09:22:15,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 349 transitions, 1064 flow. Second operand has 18 states, 18 states have (on average 272.0) internal successors, (4896), 18 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:15,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:15,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-02-06 09:22:15,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:15,583 INFO L124 PetriNetUnfolderBase]: 159/1999 cut-off events. [2025-02-06 09:22:15,583 INFO L125 PetriNetUnfolderBase]: For 184/198 co-relation queries the response was YES. [2025-02-06 09:22:15,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1999 events. 159/1999 cut-off events. For 184/198 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7409 event pairs, 23 based on Foata normal form. 4/1917 useless extension candidates. Maximal degree in co-relation 1862. Up to 207 conditions per place. [2025-02-06 09:22:15,589 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 19 selfloop transitions, 21 changer transitions 0/367 dead transitions. [2025-02-06 09:22:15,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 367 transitions, 1232 flow [2025-02-06 09:22:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:22:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:22:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5713 transitions. [2025-02-06 09:22:15,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512154512154513 [2025-02-06 09:22:15,598 INFO L175 Difference]: Start difference. First operand has 297 places, 349 transitions, 1064 flow. Second operand 21 states and 5713 transitions. [2025-02-06 09:22:15,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 367 transitions, 1232 flow [2025-02-06 09:22:15,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 367 transitions, 1232 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:15,606 INFO L231 Difference]: Finished difference. Result has 322 places, 362 transitions, 1194 flow [2025-02-06 09:22:15,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1194, PETRI_PLACES=322, PETRI_TRANSITIONS=362} [2025-02-06 09:22:15,608 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-02-06 09:22:15,608 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 362 transitions, 1194 flow [2025-02-06 09:22:15,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 272.0) internal successors, (4896), 18 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:15,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:15,612 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:15,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 09:22:15,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:15,814 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:15,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1077227871, now seen corresponding path program 2 times [2025-02-06 09:22:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:15,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683369905] [2025-02-06 09:22:15,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:15,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 793 statements into 2 equivalence classes. [2025-02-06 09:22:15,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 793 statements. [2025-02-06 09:22:15,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:15,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3241 trivial. 0 not checked. [2025-02-06 09:22:16,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:16,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683369905] [2025-02-06 09:22:16,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683369905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:16,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:16,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:16,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664339895] [2025-02-06 09:22:16,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:16,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:16,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:16,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:16,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:16,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-02-06 09:22:16,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 362 transitions, 1194 flow. Second operand has 6 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:16,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:16,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-02-06 09:22:16,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:17,053 INFO L124 PetriNetUnfolderBase]: 545/3096 cut-off events. [2025-02-06 09:22:17,053 INFO L125 PetriNetUnfolderBase]: For 850/943 co-relation queries the response was YES. [2025-02-06 09:22:17,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5420 conditions, 3096 events. 545/3096 cut-off events. For 850/943 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16098 event pairs, 93 based on Foata normal form. 16/2947 useless extension candidates. Maximal degree in co-relation 4359. Up to 981 conditions per place. [2025-02-06 09:22:17,066 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 131 selfloop transitions, 130 changer transitions 0/499 dead transitions. [2025-02-06 09:22:17,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 499 transitions, 2366 flow [2025-02-06 09:22:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2025-02-06 09:22:17,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665501165501166 [2025-02-06 09:22:17,068 INFO L175 Difference]: Start difference. First operand has 322 places, 362 transitions, 1194 flow. Second operand 6 states and 1487 transitions. [2025-02-06 09:22:17,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 499 transitions, 2366 flow [2025-02-06 09:22:17,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 499 transitions, 2342 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:22:17,076 INFO L231 Difference]: Finished difference. Result has 326 places, 491 transitions, 2398 flow [2025-02-06 09:22:17,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2398, PETRI_PLACES=326, PETRI_TRANSITIONS=491} [2025-02-06 09:22:17,079 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 40 predicate places. [2025-02-06 09:22:17,079 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 491 transitions, 2398 flow [2025-02-06 09:22:17,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:17,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:17,080 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:17,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:22:17,080 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:17,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash -755594938, now seen corresponding path program 1 times [2025-02-06 09:22:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:17,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739962311] [2025-02-06 09:22:17,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:17,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-02-06 09:22:17,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-02-06 09:22:17,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:17,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 0 proven. 3094 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 09:22:18,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739962311] [2025-02-06 09:22:18,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739962311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053542529] [2025-02-06 09:22:18,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:18,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:18,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:18,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:22:18,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:22:18,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-02-06 09:22:18,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-02-06 09:22:18,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:18,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:18,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 3147 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:22:18,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 0 proven. 3094 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 09:22:19,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 0 proven. 3094 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 09:22:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053542529] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:20,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:22:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23677146] [2025-02-06 09:22:20,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:20,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:22:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:20,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:22:20,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:22:20,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-02-06 09:22:20,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 491 transitions, 2398 flow. Second operand has 23 states, 23 states have (on average 272.0869565217391) internal successors, (6258), 23 states have internal predecessors, (6258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:20,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:20,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-02-06 09:22:20,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:21,074 INFO L124 PetriNetUnfolderBase]: 420/3101 cut-off events. [2025-02-06 09:22:21,074 INFO L125 PetriNetUnfolderBase]: For 1170/1200 co-relation queries the response was YES. [2025-02-06 09:22:21,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 3101 events. 420/3101 cut-off events. For 1170/1200 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13560 event pairs, 39 based on Foata normal form. 7/3000 useless extension candidates. Maximal degree in co-relation 4085. Up to 468 conditions per place. [2025-02-06 09:22:21,088 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 22 selfloop transitions, 30 changer transitions 0/508 dead transitions. [2025-02-06 09:22:21,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 508 transitions, 2624 flow [2025-02-06 09:22:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:22:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:22:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8154 transitions. [2025-02-06 09:22:21,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503496503496504 [2025-02-06 09:22:21,098 INFO L175 Difference]: Start difference. First operand has 326 places, 491 transitions, 2398 flow. Second operand 30 states and 8154 transitions. [2025-02-06 09:22:21,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 508 transitions, 2624 flow [2025-02-06 09:22:21,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 508 transitions, 2624 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:21,111 INFO L231 Difference]: Finished difference. Result has 359 places, 501 transitions, 2550 flow [2025-02-06 09:22:21,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2550, PETRI_PLACES=359, PETRI_TRANSITIONS=501} [2025-02-06 09:22:21,112 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 73 predicate places. [2025-02-06 09:22:21,112 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 501 transitions, 2550 flow [2025-02-06 09:22:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 272.0869565217391) internal successors, (6258), 23 states have internal predecessors, (6258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:21,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:21,114 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:21,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 09:22:21,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:21,315 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:21,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash 449423701, now seen corresponding path program 2 times [2025-02-06 09:22:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:21,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859726301] [2025-02-06 09:22:21,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:21,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1118 statements into 2 equivalence classes. [2025-02-06 09:22:21,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 1118 statements. [2025-02-06 09:22:21,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:21,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-02-06 09:22:21,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:21,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859726301] [2025-02-06 09:22:21,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859726301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:21,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:21,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:21,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165176832] [2025-02-06 09:22:21,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:21,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:21,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:21,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:21,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:21,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-02-06 09:22:21,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 501 transitions, 2550 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:21,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:21,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-02-06 09:22:21,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:22,957 INFO L124 PetriNetUnfolderBase]: 821/4177 cut-off events. [2025-02-06 09:22:22,958 INFO L125 PetriNetUnfolderBase]: For 3302/3537 co-relation queries the response was YES. [2025-02-06 09:22:22,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8767 conditions, 4177 events. 821/4177 cut-off events. For 3302/3537 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22434 event pairs, 74 based on Foata normal form. 76/4078 useless extension candidates. Maximal degree in co-relation 7239. Up to 1323 conditions per place. [2025-02-06 09:22:22,969 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 251 selfloop transitions, 131 changer transitions 5/639 dead transitions. [2025-02-06 09:22:22,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 639 transitions, 4224 flow [2025-02-06 09:22:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2025-02-06 09:22:22,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-02-06 09:22:22,970 INFO L175 Difference]: Start difference. First operand has 359 places, 501 transitions, 2550 flow. Second operand 6 states and 1488 transitions. [2025-02-06 09:22:22,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 639 transitions, 4224 flow [2025-02-06 09:22:22,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 639 transitions, 4178 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-06 09:22:22,982 INFO L231 Difference]: Finished difference. Result has 351 places, 629 transitions, 3984 flow [2025-02-06 09:22:22,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2504, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3984, PETRI_PLACES=351, PETRI_TRANSITIONS=629} [2025-02-06 09:22:22,983 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 65 predicate places. [2025-02-06 09:22:22,983 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 629 transitions, 3984 flow [2025-02-06 09:22:22,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:22,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:22,984 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:22,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:22:22,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1943527557, now seen corresponding path program 1 times [2025-02-06 09:22:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:22,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175729997] [2025-02-06 09:22:22,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:22,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:23,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1119 statements into 1 equivalence classes. [2025-02-06 09:22:23,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1119 of 1119 statements. [2025-02-06 09:22:23,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:23,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-02-06 09:22:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175729997] [2025-02-06 09:22:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175729997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:25,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176001749] [2025-02-06 09:22:25,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:25,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:25,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:25,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:25,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:26,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 286 [2025-02-06 09:22:26,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 629 transitions, 3984 flow. Second operand has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:26,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:26,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 286 [2025-02-06 09:22:26,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:27,689 INFO L124 PetriNetUnfolderBase]: 1308/5506 cut-off events. [2025-02-06 09:22:27,690 INFO L125 PetriNetUnfolderBase]: For 4888/4945 co-relation queries the response was YES. [2025-02-06 09:22:27,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13385 conditions, 5506 events. 1308/5506 cut-off events. For 4888/4945 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33873 event pairs, 369 based on Foata normal form. 11/5272 useless extension candidates. Maximal degree in co-relation 11796. Up to 2549 conditions per place. [2025-02-06 09:22:27,714 INFO L140 encePairwiseOnDemand]: 267/286 looper letters, 316 selfloop transitions, 84 changer transitions 0/708 dead transitions. [2025-02-06 09:22:27,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 708 transitions, 5182 flow [2025-02-06 09:22:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1366 transitions. [2025-02-06 09:22:27,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796037296037296 [2025-02-06 09:22:27,715 INFO L175 Difference]: Start difference. First operand has 351 places, 629 transitions, 3984 flow. Second operand 6 states and 1366 transitions. [2025-02-06 09:22:27,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 708 transitions, 5182 flow [2025-02-06 09:22:27,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 708 transitions, 4928 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:27,743 INFO L231 Difference]: Finished difference. Result has 360 places, 700 transitions, 4520 flow [2025-02-06 09:22:27,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=3736, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4520, PETRI_PLACES=360, PETRI_TRANSITIONS=700} [2025-02-06 09:22:27,744 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 74 predicate places. [2025-02-06 09:22:27,745 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 700 transitions, 4520 flow [2025-02-06 09:22:27,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:27,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:27,746 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:22:27,746 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -455258244, now seen corresponding path program 1 times [2025-02-06 09:22:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416565995] [2025-02-06 09:22:27,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:27,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-02-06 09:22:27,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-02-06 09:22:27,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:27,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-02-06 09:22:28,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:28,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416565995] [2025-02-06 09:22:28,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416565995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:28,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:28,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:22:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973615082] [2025-02-06 09:22:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:28,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:22:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:28,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:22:28,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:22:28,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 286 [2025-02-06 09:22:28,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 700 transitions, 4520 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:28,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:28,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 286 [2025-02-06 09:22:28,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:28,893 INFO L124 PetriNetUnfolderBase]: 3/1385 cut-off events. [2025-02-06 09:22:28,893 INFO L125 PetriNetUnfolderBase]: For 221/222 co-relation queries the response was YES. [2025-02-06 09:22:28,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 1385 events. 3/1385 cut-off events. For 221/222 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 556 event pairs, 1 based on Foata normal form. 3/1373 useless extension candidates. Maximal degree in co-relation 1489. Up to 51 conditions per place. [2025-02-06 09:22:28,896 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 2 selfloop transitions, 4 changer transitions 0/300 dead transitions. [2025-02-06 09:22:28,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 300 transitions, 1040 flow [2025-02-06 09:22:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:22:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:22:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-02-06 09:22:28,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9813519813519813 [2025-02-06 09:22:28,897 INFO L175 Difference]: Start difference. First operand has 360 places, 700 transitions, 4520 flow. Second operand 3 states and 842 transitions. [2025-02-06 09:22:28,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 300 transitions, 1040 flow [2025-02-06 09:22:28,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 300 transitions, 836 flow, removed 62 selfloop flow, removed 36 redundant places. [2025-02-06 09:22:28,903 INFO L231 Difference]: Finished difference. Result has 322 places, 300 transitions, 832 flow [2025-02-06 09:22:28,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=322, PETRI_TRANSITIONS=300} [2025-02-06 09:22:28,903 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-02-06 09:22:28,903 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 300 transitions, 832 flow [2025-02-06 09:22:28,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:28,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:28,904 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:28,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:22:28,904 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:28,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:28,907 INFO L85 PathProgramCache]: Analyzing trace with hash 115544959, now seen corresponding path program 1 times [2025-02-06 09:22:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:28,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574807617] [2025-02-06 09:22:28,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:28,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:29,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1127 statements into 1 equivalence classes. [2025-02-06 09:22:29,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1127 of 1127 statements. [2025-02-06 09:22:29,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:29,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-02-06 09:22:31,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:31,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574807617] [2025-02-06 09:22:31,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574807617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:31,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:31,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:31,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088926529] [2025-02-06 09:22:31,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:31,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:31,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:31,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:31,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:31,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 286 [2025-02-06 09:22:31,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 300 transitions, 832 flow. Second operand has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:31,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:31,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 286 [2025-02-06 09:22:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:32,069 INFO L124 PetriNetUnfolderBase]: 3/1382 cut-off events. [2025-02-06 09:22:32,069 INFO L125 PetriNetUnfolderBase]: For 137/142 co-relation queries the response was YES. [2025-02-06 09:22:32,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 1382 events. 3/1382 cut-off events. For 137/142 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 543 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1721. Up to 456 conditions per place. [2025-02-06 09:22:32,076 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 74 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-02-06 09:22:32,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 299 transitions, 988 flow [2025-02-06 09:22:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1304 transitions. [2025-02-06 09:22:32,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599067599067599 [2025-02-06 09:22:32,081 INFO L175 Difference]: Start difference. First operand has 322 places, 300 transitions, 832 flow. Second operand 6 states and 1304 transitions. [2025-02-06 09:22:32,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 299 transitions, 988 flow [2025-02-06 09:22:32,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 299 transitions, 981 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:22:32,085 INFO L231 Difference]: Finished difference. Result has 324 places, 299 transitions, 833 flow [2025-02-06 09:22:32,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=324, PETRI_TRANSITIONS=299} [2025-02-06 09:22:32,085 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 38 predicate places. [2025-02-06 09:22:32,085 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 299 transitions, 833 flow [2025-02-06 09:22:32,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:32,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:32,087 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:32,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:22:32,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:32,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash -327780419, now seen corresponding path program 1 times [2025-02-06 09:22:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863283516] [2025-02-06 09:22:32,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:32,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1138 statements into 1 equivalence classes. [2025-02-06 09:22:32,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1138 of 1138 statements. [2025-02-06 09:22:32,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:32,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-02-06 09:22:34,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863283516] [2025-02-06 09:22:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863283516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:34,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:34,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97700977] [2025-02-06 09:22:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:34,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:34,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:34,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:34,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:34,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 286 [2025-02-06 09:22:34,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 299 transitions, 833 flow. Second operand has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:34,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:34,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 286 [2025-02-06 09:22:34,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:35,194 INFO L124 PetriNetUnfolderBase]: 5/1413 cut-off events. [2025-02-06 09:22:35,194 INFO L125 PetriNetUnfolderBase]: For 134/135 co-relation queries the response was YES. [2025-02-06 09:22:35,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 1413 events. 5/1413 cut-off events. For 134/135 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 664 event pairs, 3 based on Foata normal form. 0/1403 useless extension candidates. Maximal degree in co-relation 1661. Up to 345 conditions per place. [2025-02-06 09:22:35,196 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 52 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-02-06 09:22:35,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 298 transitions, 945 flow [2025-02-06 09:22:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1419 transitions. [2025-02-06 09:22:35,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2025-02-06 09:22:35,198 INFO L175 Difference]: Start difference. First operand has 324 places, 299 transitions, 833 flow. Second operand 6 states and 1419 transitions. [2025-02-06 09:22:35,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 298 transitions, 945 flow [2025-02-06 09:22:35,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 298 transitions, 935 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:35,202 INFO L231 Difference]: Finished difference. Result has 323 places, 298 transitions, 831 flow [2025-02-06 09:22:35,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=323, PETRI_TRANSITIONS=298} [2025-02-06 09:22:35,202 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 37 predicate places. [2025-02-06 09:22:35,202 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 298 transitions, 831 flow [2025-02-06 09:22:35,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:35,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:35,203 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:35,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:22:35,204 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:35,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:35,206 INFO L85 PathProgramCache]: Analyzing trace with hash -425106078, now seen corresponding path program 1 times [2025-02-06 09:22:35,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:35,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822747366] [2025-02-06 09:22:35,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:35,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:35,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-02-06 09:22:35,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-02-06 09:22:35,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:35,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-02-06 09:22:37,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822747366] [2025-02-06 09:22:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822747366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:37,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:37,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:37,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240254679] [2025-02-06 09:22:37,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:37,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:37,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:37,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:37,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:38,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-02-06 09:22:38,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 298 transitions, 831 flow. Second operand has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:38,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:38,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-02-06 09:22:38,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:38,471 INFO L124 PetriNetUnfolderBase]: 3/1376 cut-off events. [2025-02-06 09:22:38,472 INFO L125 PetriNetUnfolderBase]: For 133/134 co-relation queries the response was YES. [2025-02-06 09:22:38,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1376 events. 3/1376 cut-off events. For 133/134 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 506 event pairs, 1 based on Foata normal form. 0/1373 useless extension candidates. Maximal degree in co-relation 1662. Up to 351 conditions per place. [2025-02-06 09:22:38,474 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 54 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2025-02-06 09:22:38,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 297 transitions, 947 flow [2025-02-06 09:22:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2025-02-06 09:22:38,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2025-02-06 09:22:38,475 INFO L175 Difference]: Start difference. First operand has 323 places, 298 transitions, 831 flow. Second operand 6 states and 1409 transitions. [2025-02-06 09:22:38,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 297 transitions, 947 flow [2025-02-06 09:22:38,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 297 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:38,479 INFO L231 Difference]: Finished difference. Result has 322 places, 297 transitions, 829 flow [2025-02-06 09:22:38,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=829, PETRI_PLACES=322, PETRI_TRANSITIONS=297} [2025-02-06 09:22:38,480 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-02-06 09:22:38,480 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 297 transitions, 829 flow [2025-02-06 09:22:38,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:38,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:38,481 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:38,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:22:38,481 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:38,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1338555600, now seen corresponding path program 1 times [2025-02-06 09:22:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:38,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620625918] [2025-02-06 09:22:38,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:38,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes. [2025-02-06 09:22:38,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements. [2025-02-06 09:22:38,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:38,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-02-06 09:22:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:41,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620625918] [2025-02-06 09:22:41,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620625918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:41,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:41,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458725402] [2025-02-06 09:22:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:41,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:41,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:41,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:41,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:41,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 286 [2025-02-06 09:22:41,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 297 transitions, 829 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:41,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:41,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 286 [2025-02-06 09:22:41,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:41,444 INFO L124 PetriNetUnfolderBase]: 3/1373 cut-off events. [2025-02-06 09:22:41,445 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2025-02-06 09:22:41,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 1373 events. 3/1373 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 491 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1802. Up to 473 conditions per place. [2025-02-06 09:22:41,447 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 80 selfloop transitions, 5 changer transitions 0/296 dead transitions. [2025-02-06 09:22:41,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 296 transitions, 997 flow [2025-02-06 09:22:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-02-06 09:22:41,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7453379953379954 [2025-02-06 09:22:41,448 INFO L175 Difference]: Start difference. First operand has 322 places, 297 transitions, 829 flow. Second operand 6 states and 1279 transitions. [2025-02-06 09:22:41,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 296 transitions, 997 flow [2025-02-06 09:22:41,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 296 transitions, 987 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:41,452 INFO L231 Difference]: Finished difference. Result has 321 places, 296 transitions, 827 flow [2025-02-06 09:22:41,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=827, PETRI_PLACES=321, PETRI_TRANSITIONS=296} [2025-02-06 09:22:41,452 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 35 predicate places. [2025-02-06 09:22:41,452 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 296 transitions, 827 flow [2025-02-06 09:22:41,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:41,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:41,453 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:41,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:22:41,453 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:41,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:41,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1612038356, now seen corresponding path program 1 times [2025-02-06 09:22:41,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:41,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69876541] [2025-02-06 09:22:41,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:41,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:41,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1165 statements into 1 equivalence classes. [2025-02-06 09:22:41,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1165 of 1165 statements. [2025-02-06 09:22:41,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:41,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6838 trivial. 0 not checked. [2025-02-06 09:22:44,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:44,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69876541] [2025-02-06 09:22:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69876541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:44,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:44,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:44,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185442373] [2025-02-06 09:22:44,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:44,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:44,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 286 [2025-02-06 09:22:44,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 296 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:44,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:44,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 286 [2025-02-06 09:22:44,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:44,760 INFO L124 PetriNetUnfolderBase]: 3/1370 cut-off events. [2025-02-06 09:22:44,760 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2025-02-06 09:22:44,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 1370 events. 3/1370 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 474 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1841. Up to 470 conditions per place. [2025-02-06 09:22:44,763 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 0 selfloop transitions, 0 changer transitions 295/295 dead transitions. [2025-02-06 09:22:44,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 295 transitions, 993 flow [2025-02-06 09:22:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-02-06 09:22:44,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7482517482517482 [2025-02-06 09:22:44,764 INFO L175 Difference]: Start difference. First operand has 321 places, 296 transitions, 827 flow. Second operand 6 states and 1284 transitions. [2025-02-06 09:22:44,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 295 transitions, 993 flow [2025-02-06 09:22:44,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 295 transitions, 983 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:44,767 INFO L231 Difference]: Finished difference. Result has 320 places, 0 transitions, 0 flow [2025-02-06 09:22:44,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=320, PETRI_TRANSITIONS=0} [2025-02-06 09:22:44,767 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 34 predicate places. [2025-02-06 09:22:44,768 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 0 transitions, 0 flow [2025-02-06 09:22:44,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:44,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2025-02-06 09:22:44,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-02-06 09:22:44,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-02-06 09:22:44,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-02-06 09:22:44,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-02-06 09:22:44,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-02-06 09:22:44,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-02-06 09:22:44,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-02-06 09:22:44,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-02-06 09:22:44,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-02-06 09:22:44,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:22:44,772 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:44,776 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:22:44,776 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:22:44,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:22:44 BasicIcfg [2025-02-06 09:22:44,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:22:44,783 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:22:44,783 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:22:44,783 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:22:44,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:04" (3/4) ... [2025-02-06 09:22:44,785 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:22:44,787 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-06 09:22:44,791 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 09:22:44,792 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:22:44,792 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 09:22:44,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:22:44,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:22:44,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:22:44,864 INFO L158 Benchmark]: Toolchain (without parser) took 41852.92ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 110.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 830.6MB. Max. memory is 16.1GB. [2025-02-06 09:22:44,864 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:22:44,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.91ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 71.2MB in the end (delta: 39.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 09:22:44,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 67.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:22:44,865 INFO L158 Benchmark]: Boogie Preprocessor took 29.35ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 63.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:22:44,865 INFO L158 Benchmark]: IcfgBuilder took 672.43ms. Allocated memory is still 142.6MB. Free memory was 63.9MB in the beginning and 97.3MB in the end (delta: -33.3MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2025-02-06 09:22:44,865 INFO L158 Benchmark]: TraceAbstraction took 40478.33ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 96.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 806.4MB. Max. memory is 16.1GB. [2025-02-06 09:22:44,866 INFO L158 Benchmark]: Witness Printer took 79.30ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:22:44,867 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.29ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.91ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 71.2MB in the end (delta: 39.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 67.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.35ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 63.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 672.43ms. Allocated memory is still 142.6MB. Free memory was 63.9MB in the beginning and 97.3MB in the end (delta: -33.3MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40478.33ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 96.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 806.4MB. Max. memory is 16.1GB. * Witness Printer took 79.30ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1264]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1264]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1265]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1259]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1260]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1249]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 375 locations, 25 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: 40.3s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4836 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3108 mSDsluCounter, 463 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9760 IncrementalHoareTripleChecker+Invalid, 10691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 931 mSolverCounterUnsat, 34 mSDtfsCounter, 9760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2827 GetRequests, 2671 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4520occurred in iteration=15, InterpolantAutomatonStates: 162, 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.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 13636 NumberOfCodeBlocks, 11536 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14942 ConstructedInterpolants, 0 QuantifiedInterpolants, 23474 SizeOfPredicates, 22 NumberOfNonLiveVariables, 5137 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 59041/69658 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:22:44,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE