./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-complex/safestack_relacy.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 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:27:23,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:27:23,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:27:23,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:27:23,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:27:23,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:27:23,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:27:23,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:27:23,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:27:23,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:27:23,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:27:23,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:27:23,945 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:27:23,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:27:23,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:27:23,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:27:23,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:27:23,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:27:23,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:23,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:27:23,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:27:23,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:27:23,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:27:23,948 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 -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2025-02-08 05:27:24,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:27:24,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:27:24,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:27:24,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:27:24,197 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:27:24,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-02-08 05:27:25,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e1847084/accaf542b7614c6f999a1c8114602b25/FLAG86d728040 [2025-02-08 05:27:25,727 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:27:25,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-02-08 05:27:25,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e1847084/accaf542b7614c6f999a1c8114602b25/FLAG86d728040 [2025-02-08 05:27:25,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e1847084/accaf542b7614c6f999a1c8114602b25 [2025-02-08 05:27:25,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:27:25,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:27:25,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:25,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:27:25,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:27:25,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:25" (1/1) ... [2025-02-08 05:27:25,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:25, skipping insertion in model container [2025-02-08 05:27:25,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:25" (1/1) ... [2025-02-08 05:27:25,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:27:26,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:26,185 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:27:26,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:26,326 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:27:26,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26 WrapperNode [2025-02-08 05:27:26,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:26,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:26,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:27:26,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:27:26,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,393 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 310 [2025-02-08 05:27:26,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:26,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:27:26,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:27:26,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:27:26,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:27:26,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:27:26,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:27:26,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:27:26,464 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (1/1) ... [2025-02-08 05:27:26,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:26,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:27:26,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:27:26,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:27:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:27:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:27:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:27:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:27:26,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:27:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:27:26,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:27:26,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:27:26,513 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:27:26,731 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:27:26,732 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:27:27,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742: havoc #t~ret32#1; [2025-02-08 05:27:27,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-1: ~elem~0#1 := #t~ret32#1; [2025-02-08 05:27:27,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-2: assume { :end_inline_Pop } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647; [2025-02-08 05:27:27,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-3: havoc Pop_#t~mem12#1, Pop_#t~mem13#1, Pop_#t~mem14#1, Pop_#t~nondet15#1, Pop_#t~ret16#1, Pop_#t~mem17#1, Pop_#t~ret18#1, Pop_#t~nondet19#1, Pop_#t~mem20#1, Pop_#t~nondet21#1, Pop_#t~mem22#1, Pop_#t~nondet23#1, Pop_~head2~0#1, Pop_~head1~0#1, Pop_~next1~0#1; [2025-02-08 05:27:27,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-4: #t~ret32#1 := Pop_#res#1; [2025-02-08 05:27:27,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1743: assume ~elem~0#1 >= 0; [2025-02-08 05:27:27,148 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1743: assume !(~elem~0#1 >= 0); [2025-02-08 05:27:27,149 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:27:27,149 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:27:27,317 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:27:27,318 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:27:27,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:27 BoogieIcfgContainer [2025-02-08 05:27:27,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:27:27,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:27:27,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:27:27,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:27:27,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:27:25" (1/3) ... [2025-02-08 05:27:27,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e3f8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:27, skipping insertion in model container [2025-02-08 05:27:27,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:26" (2/3) ... [2025-02-08 05:27:27,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e3f8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:27, skipping insertion in model container [2025-02-08 05:27:27,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:27" (3/3) ... [2025-02-08 05:27:27,326 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-02-08 05:27:27,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:27:27,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 198 locations, 1 initial locations, 7 loop locations, and 24 error locations. [2025-02-08 05:27:27,337 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:27:27,412 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:27:27,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 209 transitions, 425 flow [2025-02-08 05:27:27,503 INFO L124 PetriNetUnfolderBase]: 11/235 cut-off events. [2025-02-08 05:27:27,504 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:27:27,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 235 events. 11/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 546 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 153. Up to 3 conditions per place. [2025-02-08 05:27:27,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 209 transitions, 425 flow [2025-02-08 05:27:27,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 209 transitions, 425 flow [2025-02-08 05:27:27,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:27:27,535 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;@168717c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:27:27,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-02-08 05:27:27,541 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:27:27,542 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-08 05:27:27,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:27,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:27,543 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] [2025-02-08 05:27:27,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:27:27,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1235944920, now seen corresponding path program 1 times [2025-02-08 05:27:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915335656] [2025-02-08 05:27:27,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:27,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:27:27,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:27:27,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:27,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915335656] [2025-02-08 05:27:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915335656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:28,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:28,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:27:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560373182] [2025-02-08 05:27:28,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:28,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:27:28,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:28,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:27:28,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:27:28,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 209 [2025-02-08 05:27:28,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 209 transitions, 425 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:28,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:28,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 209 [2025-02-08 05:27:28,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:28,170 INFO L124 PetriNetUnfolderBase]: 5/158 cut-off events. [2025-02-08 05:27:28,170 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:27:28,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 158 events. 5/158 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs, 0 based on Foata normal form. 2/147 useless extension candidates. Maximal degree in co-relation 86. Up to 13 conditions per place. [2025-02-08 05:27:28,172 INFO L140 encePairwiseOnDemand]: 193/209 looper letters, 12 selfloop transitions, 0 changer transitions 0/132 dead transitions. [2025-02-08 05:27:28,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 132 transitions, 295 flow [2025-02-08 05:27:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:27:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:27:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 364 transitions. [2025-02-08 05:27:28,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8708133971291866 [2025-02-08 05:27:28,188 INFO L175 Difference]: Start difference. First operand has 201 places, 209 transitions, 425 flow. Second operand 2 states and 364 transitions. [2025-02-08 05:27:28,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 132 transitions, 295 flow [2025-02-08 05:27:28,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 295 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:28,196 INFO L231 Difference]: Finished difference. Result has 131 places, 132 transitions, 271 flow [2025-02-08 05:27:28,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=271, PETRI_PLACES=131, PETRI_TRANSITIONS=132} [2025-02-08 05:27:28,201 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -70 predicate places. [2025-02-08 05:27:28,202 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 132 transitions, 271 flow [2025-02-08 05:27:28,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:28,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:28,203 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] [2025-02-08 05:27:28,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:27:28,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:27:28,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1987940024, now seen corresponding path program 1 times [2025-02-08 05:27:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010383971] [2025-02-08 05:27:28,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:28,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:27:28,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:27:28,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:28,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010383971] [2025-02-08 05:27:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010383971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:28,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:28,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:27:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162781367] [2025-02-08 05:27:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:28,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:27:28,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:28,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:27:28,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:27:28,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 209 [2025-02-08 05:27:28,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 132 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:28,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:28,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 209 [2025-02-08 05:27:28,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:28,520 INFO L124 PetriNetUnfolderBase]: 5/163 cut-off events. [2025-02-08 05:27:28,520 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:27:28,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 163 events. 5/163 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 243 event pairs, 0 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 189. Up to 10 conditions per place. [2025-02-08 05:27:28,521 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 17 selfloop transitions, 6 changer transitions 0/134 dead transitions. [2025-02-08 05:27:28,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 321 flow [2025-02-08 05:27:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:27:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:27:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 819 transitions. [2025-02-08 05:27:28,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.783732057416268 [2025-02-08 05:27:28,529 INFO L175 Difference]: Start difference. First operand has 131 places, 132 transitions, 271 flow. Second operand 5 states and 819 transitions. [2025-02-08 05:27:28,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 321 flow [2025-02-08 05:27:28,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:28,533 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 291 flow [2025-02-08 05:27:28,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-02-08 05:27:28,535 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -65 predicate places. [2025-02-08 05:27:28,535 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 291 flow [2025-02-08 05:27:28,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:28,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:28,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:27:28,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:27:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1080676400, now seen corresponding path program 1 times [2025-02-08 05:27:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645633910] [2025-02-08 05:27:28,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:28,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:27:28,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:27:28,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:28,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:28,645 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-08 05:27:28,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:28,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645633910] [2025-02-08 05:27:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645633910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:28,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:27:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916630680] [2025-02-08 05:27:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:28,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:28,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:28,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 209 [2025-02-08 05:27:28,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:28,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:28,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 209 [2025-02-08 05:27:28,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:28,785 INFO L124 PetriNetUnfolderBase]: 22/318 cut-off events. [2025-02-08 05:27:28,785 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:27:28,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 318 events. 22/318 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1212 event pairs, 6 based on Foata normal form. 8/304 useless extension candidates. Maximal degree in co-relation 388. Up to 37 conditions per place. [2025-02-08 05:27:28,789 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 21 selfloop transitions, 4 changer transitions 5/139 dead transitions. [2025-02-08 05:27:28,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 139 transitions, 357 flow [2025-02-08 05:27:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-02-08 05:27:28,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8070175438596491 [2025-02-08 05:27:28,794 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 291 flow. Second operand 3 states and 506 transitions. [2025-02-08 05:27:28,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 139 transitions, 357 flow [2025-02-08 05:27:28,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 139 transitions, 347 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:28,797 INFO L231 Difference]: Finished difference. Result has 136 places, 128 transitions, 285 flow [2025-02-08 05:27:28,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=136, PETRI_TRANSITIONS=128} [2025-02-08 05:27:28,798 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -65 predicate places. [2025-02-08 05:27:28,798 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 128 transitions, 285 flow [2025-02-08 05:27:28,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:28,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:28,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:28,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:27:28,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:27:28,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:28,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1359312675, now seen corresponding path program 1 times [2025-02-08 05:27:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:28,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370781276] [2025-02-08 05:27:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:27:28,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:27:28,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:28,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370781276] [2025-02-08 05:27:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370781276] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:27:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029081665] [2025-02-08 05:27:28,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:28,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:27:28,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:27:28,994 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-08 05:27:28,995 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-08 05:27:29,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:27:29,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:27:29,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:29,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:29,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:27:29,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:27:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:29,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:27:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029081665] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:27:29,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:27:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 05:27:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431041509] [2025-02-08 05:27:29,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:27:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:27:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:29,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:27:29,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:27:29,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 209 [2025-02-08 05:27:29,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 128 transitions, 285 flow. Second operand has 15 states, 15 states have (on average 158.4) internal successors, (2376), 15 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:29,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:29,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 209 [2025-02-08 05:27:29,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:29,443 INFO L124 PetriNetUnfolderBase]: 4/153 cut-off events. [2025-02-08 05:27:29,443 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-02-08 05:27:29,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 153 events. 4/153 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 179 event pairs, 0 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 197. Up to 10 conditions per place. [2025-02-08 05:27:29,444 INFO L140 encePairwiseOnDemand]: 199/209 looper letters, 20 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2025-02-08 05:27:29,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 355 flow [2025-02-08 05:27:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:27:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 05:27:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1279 transitions. [2025-02-08 05:27:29,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7649521531100478 [2025-02-08 05:27:29,449 INFO L175 Difference]: Start difference. First operand has 136 places, 128 transitions, 285 flow. Second operand 8 states and 1279 transitions. [2025-02-08 05:27:29,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 355 flow [2025-02-08 05:27:29,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:29,453 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 323 flow [2025-02-08 05:27:29,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=140, PETRI_TRANSITIONS=131} [2025-02-08 05:27:29,454 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -61 predicate places. [2025-02-08 05:27:29,455 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 323 flow [2025-02-08 05:27:29,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 158.4) internal successors, (2376), 15 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:29,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:29,456 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:29,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:27:29,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:27:29,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:27:29,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808715, now seen corresponding path program 2 times [2025-02-08 05:27:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:29,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971129543] [2025-02-08 05:27:29,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:27:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:29,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-08 05:27:29,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 61 statements. [2025-02-08 05:27:29,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:27:29,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:29,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:29,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971129543] [2025-02-08 05:27:29,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971129543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:29,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:29,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:27:29,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76279576] [2025-02-08 05:27:29,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:29,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:27:29,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:29,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:27:29,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:27:30,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 209 [2025-02-08 05:27:30,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:30,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:30,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 209 [2025-02-08 05:27:30,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:30,281 INFO L124 PetriNetUnfolderBase]: 144/647 cut-off events. [2025-02-08 05:27:30,281 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:27:30,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 647 events. 144/647 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3786 event pairs, 48 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 982. Up to 246 conditions per place. [2025-02-08 05:27:30,283 INFO L140 encePairwiseOnDemand]: 196/209 looper letters, 31 selfloop transitions, 30 changer transitions 0/160 dead transitions. [2025-02-08 05:27:30,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 160 transitions, 503 flow [2025-02-08 05:27:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:27:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:27:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2025-02-08 05:27:30,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7145135566188198 [2025-02-08 05:27:30,286 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 323 flow. Second operand 6 states and 896 transitions. [2025-02-08 05:27:30,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 160 transitions, 503 flow [2025-02-08 05:27:30,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 160 transitions, 493 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:30,289 INFO L231 Difference]: Finished difference. Result has 147 places, 160 transitions, 515 flow [2025-02-08 05:27:30,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=147, PETRI_TRANSITIONS=160} [2025-02-08 05:27:30,289 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -54 predicate places. [2025-02-08 05:27:30,290 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 160 transitions, 515 flow [2025-02-08 05:27:30,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:30,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:30,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:30,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:27:30,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:27:30,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash -342142079, now seen corresponding path program 1 times [2025-02-08 05:27:30,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:30,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177621426] [2025-02-08 05:27:30,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:30,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:30,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:27:30,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:27:30,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:30,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177621426] [2025-02-08 05:27:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177621426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:30,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:27:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857638735] [2025-02-08 05:27:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:30,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:27:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:30,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:27:30,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:27:30,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 209 [2025-02-08 05:27:30,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 160 transitions, 515 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:30,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:30,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 209 [2025-02-08 05:27:30,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:30,506 INFO L124 PetriNetUnfolderBase]: 84/504 cut-off events. [2025-02-08 05:27:30,506 INFO L125 PetriNetUnfolderBase]: For 168/169 co-relation queries the response was YES. [2025-02-08 05:27:30,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 504 events. 84/504 cut-off events. For 168/169 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2468 event pairs, 0 based on Foata normal form. 8/490 useless extension candidates. Maximal degree in co-relation 868. Up to 88 conditions per place. [2025-02-08 05:27:30,508 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 44 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-02-08 05:27:30,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 152 transitions, 600 flow [2025-02-08 05:27:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:27:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:27:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2025-02-08 05:27:30,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7870813397129187 [2025-02-08 05:27:30,516 INFO L175 Difference]: Start difference. First operand has 147 places, 160 transitions, 515 flow. Second operand 4 states and 658 transitions. [2025-02-08 05:27:30,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 152 transitions, 600 flow [2025-02-08 05:27:30,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 152 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:30,521 INFO L231 Difference]: Finished difference. Result has 135 places, 145 transitions, 480 flow [2025-02-08 05:27:30,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=480, PETRI_PLACES=135, PETRI_TRANSITIONS=145} [2025-02-08 05:27:30,522 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -66 predicate places. [2025-02-08 05:27:30,522 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 145 transitions, 480 flow [2025-02-08 05:27:30,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:30,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:30,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:30,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:27:30,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-08 05:27:30,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash -717977327, now seen corresponding path program 1 times [2025-02-08 05:27:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:30,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34343826] [2025-02-08 05:27:30,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:30,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:27:30,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:27:30,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:30,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:27:30,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:27:30,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:27:30,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:27:30,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:30,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:27:30,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:27:30,610 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:27:30,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 43 remaining) [2025-02-08 05:27:30,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 43 remaining) [2025-02-08 05:27:30,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17ASSERT_VIOLATIONDATA_RACE (35 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16ASSERT_VIOLATIONDATA_RACE (34 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7ASSERT_VIOLATIONDATA_RACE (33 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15ASSERT_VIOLATIONDATA_RACE (32 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14ASSERT_VIOLATIONDATA_RACE (31 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6ASSERT_VIOLATIONDATA_RACE (30 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13ASSERT_VIOLATIONDATA_RACE (29 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONDATA_RACE (28 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (27 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9ASSERT_VIOLATIONDATA_RACE (26 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8ASSERT_VIOLATIONDATA_RACE (25 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11ASSERT_VIOLATIONDATA_RACE (24 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10ASSERT_VIOLATIONDATA_RACE (23 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (22 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (21 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (20 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (19 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (18 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17ASSERT_VIOLATIONDATA_RACE (17 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16ASSERT_VIOLATIONDATA_RACE (16 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7ASSERT_VIOLATIONDATA_RACE (15 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15ASSERT_VIOLATIONDATA_RACE (14 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14ASSERT_VIOLATIONDATA_RACE (13 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6ASSERT_VIOLATIONDATA_RACE (12 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13ASSERT_VIOLATIONDATA_RACE (11 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONDATA_RACE (10 of 43 remaining) [2025-02-08 05:27:30,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (9 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9ASSERT_VIOLATIONDATA_RACE (8 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8ASSERT_VIOLATIONDATA_RACE (7 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11ASSERT_VIOLATIONDATA_RACE (6 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10ASSERT_VIOLATIONDATA_RACE (5 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 43 remaining) [2025-02-08 05:27:30,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 43 remaining) [2025-02-08 05:27:30,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:27:30,614 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-02-08 05:27:30,619 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:27:30,619 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:27:30,683 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:27:30,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 316 places, 332 transitions, 680 flow [2025-02-08 05:27:30,731 INFO L124 PetriNetUnfolderBase]: 22/413 cut-off events. [2025-02-08 05:27:30,732 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:27:30,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 413 events. 22/413 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1510 event pairs, 0 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 293. Up to 6 conditions per place. [2025-02-08 05:27:30,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 316 places, 332 transitions, 680 flow [2025-02-08 05:27:30,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 316 places, 332 transitions, 680 flow [2025-02-08 05:27:30,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:27:30,740 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;@168717c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:27:30,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-08 05:27:30,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:27:30,742 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-08 05:27:30,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:30,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:30,742 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] [2025-02-08 05:27:30,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:30,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1466267252, now seen corresponding path program 1 times [2025-02-08 05:27:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562260075] [2025-02-08 05:27:30,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:30,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:27:30,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:27:30,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:30,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:30,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:30,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562260075] [2025-02-08 05:27:30,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562260075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:30,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:30,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:27:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715438859] [2025-02-08 05:27:30,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:30,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:27:30,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:30,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:27:30,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:27:30,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 332 [2025-02-08 05:27:30,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 332 transitions, 680 flow. Second operand has 2 states, 2 states have (on average 258.5) internal successors, (517), 2 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:30,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:30,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 332 [2025-02-08 05:27:30,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:30,948 INFO L124 PetriNetUnfolderBase]: 91/659 cut-off events. [2025-02-08 05:27:30,948 INFO L125 PetriNetUnfolderBase]: For 71/78 co-relation queries the response was YES. [2025-02-08 05:27:30,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 659 events. 91/659 cut-off events. For 71/78 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3675 event pairs, 54 based on Foata normal form. 43/646 useless extension candidates. Maximal degree in co-relation 568. Up to 140 conditions per place. [2025-02-08 05:27:30,952 INFO L140 encePairwiseOnDemand]: 304/332 looper letters, 20 selfloop transitions, 0 changer transitions 0/182 dead transitions. [2025-02-08 05:27:30,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 182 transitions, 420 flow [2025-02-08 05:27:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:27:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:27:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 564 transitions. [2025-02-08 05:27:30,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493975903614458 [2025-02-08 05:27:30,954 INFO L175 Difference]: Start difference. First operand has 316 places, 332 transitions, 680 flow. Second operand 2 states and 564 transitions. [2025-02-08 05:27:30,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 182 transitions, 420 flow [2025-02-08 05:27:30,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 182 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:30,956 INFO L231 Difference]: Finished difference. Result has 179 places, 182 transitions, 380 flow [2025-02-08 05:27:30,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=380, PETRI_PLACES=179, PETRI_TRANSITIONS=182} [2025-02-08 05:27:30,956 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -137 predicate places. [2025-02-08 05:27:30,957 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 182 transitions, 380 flow [2025-02-08 05:27:30,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 258.5) internal successors, (517), 2 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:30,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:30,957 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] [2025-02-08 05:27:30,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:27:30,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash 789501256, now seen corresponding path program 1 times [2025-02-08 05:27:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:30,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306314718] [2025-02-08 05:27:30,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:30,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:27:30,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:27:30,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:30,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306314718] [2025-02-08 05:27:31,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306314718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:31,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:31,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:27:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008954011] [2025-02-08 05:27:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:31,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:27:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:31,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:27:31,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:27:31,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 332 [2025-02-08 05:27:31,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 182 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 251.2) internal successors, (1256), 5 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:31,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:31,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 332 [2025-02-08 05:27:31,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:31,202 INFO L124 PetriNetUnfolderBase]: 91/664 cut-off events. [2025-02-08 05:27:31,202 INFO L125 PetriNetUnfolderBase]: For 71/78 co-relation queries the response was YES. [2025-02-08 05:27:31,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 664 events. 91/664 cut-off events. For 71/78 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3669 event pairs, 54 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 853. Up to 137 conditions per place. [2025-02-08 05:27:31,205 INFO L140 encePairwiseOnDemand]: 325/332 looper letters, 25 selfloop transitions, 6 changer transitions 0/184 dead transitions. [2025-02-08 05:27:31,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 184 transitions, 446 flow [2025-02-08 05:27:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:27:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:27:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1277 transitions. [2025-02-08 05:27:31,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.769277108433735 [2025-02-08 05:27:31,208 INFO L175 Difference]: Start difference. First operand has 179 places, 182 transitions, 380 flow. Second operand 5 states and 1277 transitions. [2025-02-08 05:27:31,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 184 transitions, 446 flow [2025-02-08 05:27:31,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 184 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:31,211 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 400 flow [2025-02-08 05:27:31,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=400, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2025-02-08 05:27:31,211 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -132 predicate places. [2025-02-08 05:27:31,211 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 400 flow [2025-02-08 05:27:31,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 251.2) internal successors, (1256), 5 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:31,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:31,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:31,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:27:31,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:31,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash -981036880, now seen corresponding path program 1 times [2025-02-08 05:27:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913963762] [2025-02-08 05:27:31,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:31,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:27:31,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:27:31,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:31,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:31,280 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-08 05:27:31,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:31,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913963762] [2025-02-08 05:27:31,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913963762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:31,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:31,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:27:31,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125134830] [2025-02-08 05:27:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:31,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:31,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:31,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:31,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 332 [2025-02-08 05:27:31,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:31,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:31,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 332 [2025-02-08 05:27:31,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:31,599 INFO L124 PetriNetUnfolderBase]: 433/2283 cut-off events. [2025-02-08 05:27:31,599 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-02-08 05:27:31,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3029 conditions, 2283 events. 433/2283 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 19340 event pairs, 242 based on Foata normal form. 57/2165 useless extension candidates. Maximal degree in co-relation 3022. Up to 501 conditions per place. [2025-02-08 05:27:31,611 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 41 selfloop transitions, 4 changer transitions 0/199 dead transitions. [2025-02-08 05:27:31,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 199 transitions, 528 flow [2025-02-08 05:27:31,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 794 transitions. [2025-02-08 05:27:31,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7971887550200804 [2025-02-08 05:27:31,613 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 400 flow. Second operand 3 states and 794 transitions. [2025-02-08 05:27:31,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 199 transitions, 528 flow [2025-02-08 05:27:31,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 199 transitions, 518 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:31,616 INFO L231 Difference]: Finished difference. Result has 184 places, 185 transitions, 414 flow [2025-02-08 05:27:31,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=184, PETRI_TRANSITIONS=185} [2025-02-08 05:27:31,617 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -132 predicate places. [2025-02-08 05:27:31,617 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 185 transitions, 414 flow [2025-02-08 05:27:31,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:31,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:31,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:31,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:27:31,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:31,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash -847914583, now seen corresponding path program 1 times [2025-02-08 05:27:31,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:31,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530617555] [2025-02-08 05:27:31,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:31,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:27:31,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:27:31,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:31,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:31,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530617555] [2025-02-08 05:27:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530617555] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:27:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368635621] [2025-02-08 05:27:31,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:31,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:27:31,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:27:31,760 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-08 05:27:31,761 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-08 05:27:31,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:27:31,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:27:31,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:31,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:31,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:27:31,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:27:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:31,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:27:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368635621] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:27:31,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:27:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 05:27:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659368930] [2025-02-08 05:27:31,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:27:31,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:27:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:31,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:27:32,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:27:32,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 332 [2025-02-08 05:27:32,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 185 transitions, 414 flow. Second operand has 15 states, 15 states have (on average 248.4) internal successors, (3726), 15 states have internal predecessors, (3726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:32,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:32,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 332 [2025-02-08 05:27:32,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:32,260 INFO L124 PetriNetUnfolderBase]: 90/671 cut-off events. [2025-02-08 05:27:32,260 INFO L125 PetriNetUnfolderBase]: For 76/84 co-relation queries the response was YES. [2025-02-08 05:27:32,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 671 events. 90/671 cut-off events. For 76/84 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3836 event pairs, 55 based on Foata normal form. 1/623 useless extension candidates. Maximal degree in co-relation 891. Up to 138 conditions per place. [2025-02-08 05:27:32,265 INFO L140 encePairwiseOnDemand]: 322/332 looper letters, 28 selfloop transitions, 10 changer transitions 0/190 dead transitions. [2025-02-08 05:27:32,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 190 transitions, 500 flow [2025-02-08 05:27:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:27:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 05:27:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2007 transitions. [2025-02-08 05:27:32,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7556475903614458 [2025-02-08 05:27:32,268 INFO L175 Difference]: Start difference. First operand has 184 places, 185 transitions, 414 flow. Second operand 8 states and 2007 transitions. [2025-02-08 05:27:32,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 190 transitions, 500 flow [2025-02-08 05:27:32,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 190 transitions, 496 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:32,271 INFO L231 Difference]: Finished difference. Result has 194 places, 188 transitions, 456 flow [2025-02-08 05:27:32,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=456, PETRI_PLACES=194, PETRI_TRANSITIONS=188} [2025-02-08 05:27:32,272 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -122 predicate places. [2025-02-08 05:27:32,272 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 188 transitions, 456 flow [2025-02-08 05:27:32,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 248.4) internal successors, (3726), 15 states have internal predecessors, (3726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:32,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:32,274 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:32,280 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-08 05:27:32,474 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-08 05:27:32,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash 39844161, now seen corresponding path program 2 times [2025-02-08 05:27:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:32,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650534111] [2025-02-08 05:27:32,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:27:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:32,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-08 05:27:32,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 61 statements. [2025-02-08 05:27:32,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:27:32,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:32,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650534111] [2025-02-08 05:27:32,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650534111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:32,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:32,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:27:32,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319522609] [2025-02-08 05:27:32,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:32,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:27:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:32,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:27:32,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:27:32,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 332 [2025-02-08 05:27:32,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 188 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:32,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:32,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 332 [2025-02-08 05:27:32,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:33,814 INFO L124 PetriNetUnfolderBase]: 2335/6315 cut-off events. [2025-02-08 05:27:33,814 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-02-08 05:27:33,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10136 conditions, 6315 events. 2335/6315 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 56794 event pairs, 1150 based on Foata normal form. 0/5961 useless extension candidates. Maximal degree in co-relation 10124. Up to 3180 conditions per place. [2025-02-08 05:27:33,852 INFO L140 encePairwiseOnDemand]: 313/332 looper letters, 43 selfloop transitions, 54 changer transitions 0/242 dead transitions. [2025-02-08 05:27:33,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 242 transitions, 763 flow [2025-02-08 05:27:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:27:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:27:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1422 transitions. [2025-02-08 05:27:33,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.713855421686747 [2025-02-08 05:27:33,855 INFO L175 Difference]: Start difference. First operand has 194 places, 188 transitions, 456 flow. Second operand 6 states and 1422 transitions. [2025-02-08 05:27:33,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 242 transitions, 763 flow [2025-02-08 05:27:33,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 242 transitions, 753 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:33,860 INFO L231 Difference]: Finished difference. Result has 201 places, 241 transitions, 804 flow [2025-02-08 05:27:33,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=201, PETRI_TRANSITIONS=241} [2025-02-08 05:27:33,860 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -115 predicate places. [2025-02-08 05:27:33,860 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 241 transitions, 804 flow [2025-02-08 05:27:33,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:33,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:33,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:33,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:27:33,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:33,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash -207893964, now seen corresponding path program 1 times [2025-02-08 05:27:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:33,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384522950] [2025-02-08 05:27:33,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:33,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:27:33,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:27:33,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:33,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384522950] [2025-02-08 05:27:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384522950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:33,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:33,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:27:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097062056] [2025-02-08 05:27:33,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:27:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:33,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:27:33,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:27:33,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 332 [2025-02-08 05:27:33,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 241 transitions, 804 flow. Second operand has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:33,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:33,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 332 [2025-02-08 05:27:33,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:34,600 INFO L124 PetriNetUnfolderBase]: 1598/5250 cut-off events. [2025-02-08 05:27:34,600 INFO L125 PetriNetUnfolderBase]: For 2400/2456 co-relation queries the response was YES. [2025-02-08 05:27:34,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10290 conditions, 5250 events. 1598/5250 cut-off events. For 2400/2456 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 47171 event pairs, 112 based on Foata normal form. 36/4973 useless extension candidates. Maximal degree in co-relation 10274. Up to 1594 conditions per place. [2025-02-08 05:27:34,630 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 123 selfloop transitions, 6 changer transitions 5/293 dead transitions. [2025-02-08 05:27:34,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 293 transitions, 1328 flow [2025-02-08 05:27:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:27:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:27:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1055 transitions. [2025-02-08 05:27:34,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7944277108433735 [2025-02-08 05:27:34,633 INFO L175 Difference]: Start difference. First operand has 201 places, 241 transitions, 804 flow. Second operand 4 states and 1055 transitions. [2025-02-08 05:27:34,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 293 transitions, 1328 flow [2025-02-08 05:27:34,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 293 transitions, 1328 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:34,641 INFO L231 Difference]: Finished difference. Result has 205 places, 236 transitions, 810 flow [2025-02-08 05:27:34,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=810, PETRI_PLACES=205, PETRI_TRANSITIONS=236} [2025-02-08 05:27:34,641 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -111 predicate places. [2025-02-08 05:27:34,642 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 236 transitions, 810 flow [2025-02-08 05:27:34,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:34,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:34,642 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:34,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:27:34,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:34,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1316763526, now seen corresponding path program 1 times [2025-02-08 05:27:34,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293639650] [2025-02-08 05:27:34,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:34,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:27:34,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:27:34,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:34,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:35,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:35,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293639650] [2025-02-08 05:27:35,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293639650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:35,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:35,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:27:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571459614] [2025-02-08 05:27:35,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:35,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:27:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:35,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:27:35,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:27:35,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 332 [2025-02-08 05:27:35,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 236 transitions, 810 flow. Second operand has 9 states, 9 states have (on average 222.66666666666666) internal successors, (2004), 9 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:35,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:35,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 332 [2025-02-08 05:27:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:36,754 INFO L124 PetriNetUnfolderBase]: 2162/5957 cut-off events. [2025-02-08 05:27:36,754 INFO L125 PetriNetUnfolderBase]: For 2416/2509 co-relation queries the response was YES. [2025-02-08 05:27:36,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13235 conditions, 5957 events. 2162/5957 cut-off events. For 2416/2509 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 52907 event pairs, 842 based on Foata normal form. 66/5775 useless extension candidates. Maximal degree in co-relation 13217. Up to 2159 conditions per place. [2025-02-08 05:27:36,797 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 132 selfloop transitions, 11 changer transitions 0/283 dead transitions. [2025-02-08 05:27:36,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 283 transitions, 1284 flow [2025-02-08 05:27:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:27:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 05:27:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1849 transitions. [2025-02-08 05:27:36,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6961596385542169 [2025-02-08 05:27:36,802 INFO L175 Difference]: Start difference. First operand has 205 places, 236 transitions, 810 flow. Second operand 8 states and 1849 transitions. [2025-02-08 05:27:36,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 283 transitions, 1284 flow [2025-02-08 05:27:36,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 283 transitions, 1272 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:36,811 INFO L231 Difference]: Finished difference. Result has 204 places, 235 transitions, 816 flow [2025-02-08 05:27:36,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=816, PETRI_PLACES=204, PETRI_TRANSITIONS=235} [2025-02-08 05:27:36,811 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -112 predicate places. [2025-02-08 05:27:36,811 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 235 transitions, 816 flow [2025-02-08 05:27:36,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 222.66666666666666) internal successors, (2004), 9 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:36,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:36,812 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:36,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:27:36,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:36,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash 849491831, now seen corresponding path program 1 times [2025-02-08 05:27:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018727591] [2025-02-08 05:27:36,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:36,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:27:36,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:27:36,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:36,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018727591] [2025-02-08 05:27:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018727591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:27:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972329112] [2025-02-08 05:27:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:36,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:27:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:36,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:27:36,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:27:36,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 332 [2025-02-08 05:27:36,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 235 transitions, 816 flow. Second operand has 5 states, 5 states have (on average 250.2) internal successors, (1251), 5 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:36,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:36,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 332 [2025-02-08 05:27:36,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:37,484 INFO L124 PetriNetUnfolderBase]: 1458/4767 cut-off events. [2025-02-08 05:27:37,485 INFO L125 PetriNetUnfolderBase]: For 2651/2694 co-relation queries the response was YES. [2025-02-08 05:27:37,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9748 conditions, 4767 events. 1458/4767 cut-off events. For 2651/2694 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 40636 event pairs, 129 based on Foata normal form. 57/4554 useless extension candidates. Maximal degree in co-relation 9730. Up to 1480 conditions per place. [2025-02-08 05:27:37,515 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 115 selfloop transitions, 3 changer transitions 0/264 dead transitions. [2025-02-08 05:27:37,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 264 transitions, 1232 flow [2025-02-08 05:27:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:27:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:27:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1280 transitions. [2025-02-08 05:27:37,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7710843373493976 [2025-02-08 05:27:37,518 INFO L175 Difference]: Start difference. First operand has 204 places, 235 transitions, 816 flow. Second operand 5 states and 1280 transitions. [2025-02-08 05:27:37,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 264 transitions, 1232 flow [2025-02-08 05:27:37,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 264 transitions, 1206 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 05:27:37,527 INFO L231 Difference]: Finished difference. Result has 185 places, 218 transitions, 744 flow [2025-02-08 05:27:37,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=744, PETRI_PLACES=185, PETRI_TRANSITIONS=218} [2025-02-08 05:27:37,528 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -131 predicate places. [2025-02-08 05:27:37,528 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 218 transitions, 744 flow [2025-02-08 05:27:37,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 250.2) internal successors, (1251), 5 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:37,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:37,529 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:37,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:27:37,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:27:37,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:37,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1980920192, now seen corresponding path program 1 times [2025-02-08 05:27:37,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:37,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026912561] [2025-02-08 05:27:37,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:37,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:37,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:27:37,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:27:37,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:37,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:27:37,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:27:37,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:27:37,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:27:37,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:37,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:27:37,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:27:37,586 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:27:37,586 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 61 remaining) [2025-02-08 05:27:37,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-02-08 05:27:37,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-02-08 05:27:37,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11ASSERT_VIOLATIONDATA_RACE (24 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10ASSERT_VIOLATIONDATA_RACE (23 of 61 remaining) [2025-02-08 05:27:37,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (22 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-02-08 05:27:37,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-02-08 05:27:37,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:27:37,589 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:37,590 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:27:37,590 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:27:37,646 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:27:37,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 431 places, 455 transitions, 937 flow [2025-02-08 05:27:37,709 INFO L124 PetriNetUnfolderBase]: 36/630 cut-off events. [2025-02-08 05:27:37,710 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:27:37,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 630 events. 36/630 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2697 event pairs, 1 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 454. Up to 12 conditions per place. [2025-02-08 05:27:37,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 431 places, 455 transitions, 937 flow [2025-02-08 05:27:37,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 431 places, 455 transitions, 937 flow [2025-02-08 05:27:37,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:27:37,723 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;@168717c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:27:37,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-02-08 05:27:37,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:27:37,724 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-08 05:27:37,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:37,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:37,725 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] [2025-02-08 05:27:37,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:27:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash -509588485, now seen corresponding path program 1 times [2025-02-08 05:27:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998132364] [2025-02-08 05:27:37,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:37,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:27:37,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:27:37,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:37,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998132364] [2025-02-08 05:27:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998132364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:37,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:27:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884442519] [2025-02-08 05:27:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:37,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:27:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:37,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:27:37,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:27:37,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 455 [2025-02-08 05:27:37,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 455 transitions, 937 flow. Second operand has 2 states, 2 states have (on average 348.5) internal successors, (697), 2 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:37,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:37,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 455 [2025-02-08 05:27:37,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:38,305 INFO L124 PetriNetUnfolderBase]: 1266/4805 cut-off events. [2025-02-08 05:27:38,305 INFO L125 PetriNetUnfolderBase]: For 902/920 co-relation queries the response was YES. [2025-02-08 05:27:38,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6866 conditions, 4805 events. 1266/4805 cut-off events. For 902/920 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 47276 event pairs, 907 based on Foata normal form. 564/5036 useless extension candidates. Maximal degree in co-relation 5114. Up to 1646 conditions per place. [2025-02-08 05:27:38,339 INFO L140 encePairwiseOnDemand]: 415/455 looper letters, 28 selfloop transitions, 0 changer transitions 0/232 dead transitions. [2025-02-08 05:27:38,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 232 transitions, 547 flow [2025-02-08 05:27:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:27:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:27:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 764 transitions. [2025-02-08 05:27:38,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395604395604396 [2025-02-08 05:27:38,341 INFO L175 Difference]: Start difference. First operand has 431 places, 455 transitions, 937 flow. Second operand 2 states and 764 transitions. [2025-02-08 05:27:38,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 232 transitions, 547 flow [2025-02-08 05:27:38,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 232 transitions, 547 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:38,344 INFO L231 Difference]: Finished difference. Result has 227 places, 232 transitions, 491 flow [2025-02-08 05:27:38,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=491, PETRI_PLACES=227, PETRI_TRANSITIONS=232} [2025-02-08 05:27:38,344 INFO L279 CegarLoopForPetriNet]: 431 programPoint places, -204 predicate places. [2025-02-08 05:27:38,344 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 232 transitions, 491 flow [2025-02-08 05:27:38,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 348.5) internal successors, (697), 2 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:38,345 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] [2025-02-08 05:27:38,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:27:38,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:27:38,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash -759838136, now seen corresponding path program 1 times [2025-02-08 05:27:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:38,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563493681] [2025-02-08 05:27:38,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:38,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:38,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:27:38,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:27:38,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:38,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563493681] [2025-02-08 05:27:38,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563493681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:38,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:38,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:27:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712452976] [2025-02-08 05:27:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:38,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:27:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:38,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:27:38,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:27:38,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 455 [2025-02-08 05:27:38,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 232 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 341.2) internal successors, (1706), 5 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:38,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 455 [2025-02-08 05:27:38,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:38,953 INFO L124 PetriNetUnfolderBase]: 1266/4810 cut-off events. [2025-02-08 05:27:38,953 INFO L125 PetriNetUnfolderBase]: For 895/913 co-relation queries the response was YES. [2025-02-08 05:27:38,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6883 conditions, 4810 events. 1266/4810 cut-off events. For 895/913 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 47310 event pairs, 907 based on Foata normal form. 1/4479 useless extension candidates. Maximal degree in co-relation 6877. Up to 1643 conditions per place. [2025-02-08 05:27:38,983 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 33 selfloop transitions, 6 changer transitions 0/234 dead transitions. [2025-02-08 05:27:38,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 234 transitions, 573 flow [2025-02-08 05:27:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:27:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:27:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1735 transitions. [2025-02-08 05:27:38,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7626373626373626 [2025-02-08 05:27:38,986 INFO L175 Difference]: Start difference. First operand has 227 places, 232 transitions, 491 flow. Second operand 5 states and 1735 transitions. [2025-02-08 05:27:38,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 234 transitions, 573 flow [2025-02-08 05:27:38,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 234 transitions, 573 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:38,989 INFO L231 Difference]: Finished difference. Result has 232 places, 233 transitions, 511 flow [2025-02-08 05:27:38,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=511, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2025-02-08 05:27:38,990 INFO L279 CegarLoopForPetriNet]: 431 programPoint places, -199 predicate places. [2025-02-08 05:27:38,990 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 511 flow [2025-02-08 05:27:38,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 341.2) internal successors, (1706), 5 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:38,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:38,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:27:38,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:27:38,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash 229656656, now seen corresponding path program 1 times [2025-02-08 05:27:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:38,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849025966] [2025-02-08 05:27:38,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:39,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:27:39,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:27:39,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:39,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,024 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-08 05:27:39,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849025966] [2025-02-08 05:27:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849025966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:27:39,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898712247] [2025-02-08 05:27:39,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:39,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:39,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:39,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 455 [2025-02-08 05:27:39,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 455 [2025-02-08 05:27:39,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,005 INFO L124 PetriNetUnfolderBase]: 5323/20439 cut-off events. [2025-02-08 05:27:41,006 INFO L125 PetriNetUnfolderBase]: For 1967/1967 co-relation queries the response was YES. [2025-02-08 05:27:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28079 conditions, 20439 events. 5323/20439 cut-off events. For 1967/1967 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 252530 event pairs, 2752 based on Foata normal form. 400/19431 useless extension candidates. Maximal degree in co-relation 28071. Up to 5259 conditions per place. [2025-02-08 05:27:41,120 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 56 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2025-02-08 05:27:41,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 256 transitions, 686 flow [2025-02-08 05:27:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1079 transitions. [2025-02-08 05:27:41,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904761904761904 [2025-02-08 05:27:41,122 INFO L175 Difference]: Start difference. First operand has 232 places, 233 transitions, 511 flow. Second operand 3 states and 1079 transitions. [2025-02-08 05:27:41,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 256 transitions, 686 flow [2025-02-08 05:27:41,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 256 transitions, 676 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:41,127 INFO L231 Difference]: Finished difference. Result has 232 places, 235 transitions, 525 flow [2025-02-08 05:27:41,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=232, PETRI_TRANSITIONS=235} [2025-02-08 05:27:41,127 INFO L279 CegarLoopForPetriNet]: 431 programPoint places, -199 predicate places. [2025-02-08 05:27:41,127 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 235 transitions, 525 flow [2025-02-08 05:27:41,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:41,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:27:41,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:27:41,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1971120176, now seen corresponding path program 1 times [2025-02-08 05:27:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784217921] [2025-02-08 05:27:41,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:27:41,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:27:41,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784217921] [2025-02-08 05:27:41,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784217921] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:27:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712835140] [2025-02-08 05:27:41,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:27:41,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:27:41,221 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-08 05:27:41,223 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-08 05:27:41,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:27:41,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:27:41,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:27:41,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:27:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:27:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712835140] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:27:41,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:27:41,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 05:27:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240680538] [2025-02-08 05:27:41,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:27:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:27:41,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:27:41,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 455 [2025-02-08 05:27:41,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 235 transitions, 525 flow. Second operand has 15 states, 15 states have (on average 338.4) internal successors, (5076), 15 states have internal predecessors, (5076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 455 [2025-02-08 05:27:41,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:42,217 INFO L124 PetriNetUnfolderBase]: 1284/4921 cut-off events. [2025-02-08 05:27:42,217 INFO L125 PetriNetUnfolderBase]: For 942/963 co-relation queries the response was YES. [2025-02-08 05:27:42,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7086 conditions, 4921 events. 1284/4921 cut-off events. For 942/963 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 48854 event pairs, 934 based on Foata normal form. 1/4592 useless extension candidates. Maximal degree in co-relation 7077. Up to 1672 conditions per place. [2025-02-08 05:27:42,253 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 36 selfloop transitions, 10 changer transitions 0/240 dead transitions. [2025-02-08 05:27:42,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 240 transitions, 627 flow [2025-02-08 05:27:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:27:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 05:27:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2735 transitions. [2025-02-08 05:27:42,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7513736263736264 [2025-02-08 05:27:42,257 INFO L175 Difference]: Start difference. First operand has 232 places, 235 transitions, 525 flow. Second operand 8 states and 2735 transitions. [2025-02-08 05:27:42,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 240 transitions, 627 flow [2025-02-08 05:27:42,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 240 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:42,260 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 567 flow [2025-02-08 05:27:42,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=567, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2025-02-08 05:27:42,261 INFO L279 CegarLoopForPetriNet]: 431 programPoint places, -189 predicate places. [2025-02-08 05:27:42,261 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 567 flow [2025-02-08 05:27:42,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 338.4) internal successors, (5076), 15 states have internal predecessors, (5076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:42,262 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:42,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 05:27:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:27:42,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:27:42,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash -177717048, now seen corresponding path program 2 times [2025-02-08 05:27:42,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:42,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340998369] [2025-02-08 05:27:42,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:27:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:42,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-08 05:27:42,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 61 statements. [2025-02-08 05:27:42,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:27:42,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:42,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:42,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340998369] [2025-02-08 05:27:42,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340998369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:42,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:42,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:27:42,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258214596] [2025-02-08 05:27:42,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:42,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:27:42,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:42,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:27:42,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:27:42,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 455 [2025-02-08 05:27:42,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 567 flow. Second operand has 6 states, 6 states have (on average 305.3333333333333) internal successors, (1832), 6 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:42,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 455 [2025-02-08 05:27:42,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:49,682 INFO L124 PetriNetUnfolderBase]: 26666/56200 cut-off events. [2025-02-08 05:27:49,682 INFO L125 PetriNetUnfolderBase]: For 2290/2290 co-relation queries the response was YES. [2025-02-08 05:27:49,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94071 conditions, 56200 events. 26666/56200 cut-off events. For 2290/2290 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 604306 event pairs, 14908 based on Foata normal form. 0/53629 useless extension candidates. Maximal degree in co-relation 94058. Up to 33194 conditions per place. [2025-02-08 05:27:50,104 INFO L140 encePairwiseOnDemand]: 430/455 looper letters, 52 selfloop transitions, 78 changer transitions 0/317 dead transitions. [2025-02-08 05:27:50,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 317 transitions, 997 flow [2025-02-08 05:27:50,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:27:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:27:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1947 transitions. [2025-02-08 05:27:50,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7131868131868132 [2025-02-08 05:27:50,108 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 567 flow. Second operand 6 states and 1947 transitions. [2025-02-08 05:27:50,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 317 transitions, 997 flow [2025-02-08 05:27:50,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 317 transitions, 987 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:50,114 INFO L231 Difference]: Finished difference. Result has 249 places, 315 transitions, 1071 flow [2025-02-08 05:27:50,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1071, PETRI_PLACES=249, PETRI_TRANSITIONS=315} [2025-02-08 05:27:50,115 INFO L279 CegarLoopForPetriNet]: 431 programPoint places, -182 predicate places. [2025-02-08 05:27:50,115 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 315 transitions, 1071 flow [2025-02-08 05:27:50,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.3333333333333) internal successors, (1832), 6 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:50,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:50,116 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:27:50,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:27:50,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash -501110494, now seen corresponding path program 1 times [2025-02-08 05:27:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409531730] [2025-02-08 05:27:50,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:50,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:27:50,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:27:50,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:50,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:50,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409531730] [2025-02-08 05:27:50,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409531730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:50,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:50,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:27:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341037865] [2025-02-08 05:27:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:50,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:27:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:50,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:27:50,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:27:50,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 455 [2025-02-08 05:27:50,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 315 transitions, 1071 flow. Second operand has 4 states, 4 states have (on average 341.75) internal successors, (1367), 4 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:50,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:50,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 455 [2025-02-08 05:27:50,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:55,514 INFO L124 PetriNetUnfolderBase]: 17811/46129 cut-off events. [2025-02-08 05:27:55,515 INFO L125 PetriNetUnfolderBase]: For 25489/25879 co-relation queries the response was YES. [2025-02-08 05:27:55,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97782 conditions, 46129 events. 17811/46129 cut-off events. For 25489/25879 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 530178 event pairs, 995 based on Foata normal form. 185/43965 useless extension candidates. Maximal degree in co-relation 97765. Up to 17977 conditions per place. [2025-02-08 05:27:55,900 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 175 selfloop transitions, 6 changer transitions 0/385 dead transitions. [2025-02-08 05:27:55,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 385 transitions, 1771 flow [2025-02-08 05:27:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:27:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:27:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1441 transitions. [2025-02-08 05:27:55,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7917582417582417 [2025-02-08 05:27:55,902 INFO L175 Difference]: Start difference. First operand has 249 places, 315 transitions, 1071 flow. Second operand 4 states and 1441 transitions. [2025-02-08 05:27:55,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 385 transitions, 1771 flow [2025-02-08 05:27:55,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 385 transitions, 1771 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:55,927 INFO L231 Difference]: Finished difference. Result has 253 places, 317 transitions, 1103 flow [2025-02-08 05:27:55,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1103, PETRI_PLACES=253, PETRI_TRANSITIONS=317} [2025-02-08 05:27:55,927 INFO L279 CegarLoopForPetriNet]: 431 programPoint places, -178 predicate places. [2025-02-08 05:27:55,927 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 317 transitions, 1103 flow [2025-02-08 05:27:55,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 341.75) internal successors, (1367), 4 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:55,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:55,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:55,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:27:55,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:27:55,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1368399281, now seen corresponding path program 1 times [2025-02-08 05:27:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:55,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947636809] [2025-02-08 05:27:55,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:55,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:27:55,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:27:55,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:55,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:27:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947636809] [2025-02-08 05:27:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947636809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:56,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:56,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:27:56,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517803801] [2025-02-08 05:27:56,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:56,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:27:56,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:56,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:27:56,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:27:56,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 455 [2025-02-08 05:27:56,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 317 transitions, 1103 flow. Second operand has 9 states, 9 states have (on average 304.6666666666667) internal successors, (2742), 9 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:56,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:56,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 455 [2025-02-08 05:27:56,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:04,098 INFO L124 PetriNetUnfolderBase]: 25203/54074 cut-off events. [2025-02-08 05:28:04,098 INFO L125 PetriNetUnfolderBase]: For 25757/26200 co-relation queries the response was YES. [2025-02-08 05:28:04,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128283 conditions, 54074 events. 25203/54074 cut-off events. For 25757/26200 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 583313 event pairs, 11765 based on Foata normal form. 510/52710 useless extension candidates. Maximal degree in co-relation 128264. Up to 25119 conditions per place. [2025-02-08 05:28:04,632 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 191 selfloop transitions, 11 changer transitions 0/388 dead transitions. [2025-02-08 05:28:04,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 388 transitions, 1791 flow [2025-02-08 05:28:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:28:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 05:28:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2538 transitions. [2025-02-08 05:28:04,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6972527472527472 [2025-02-08 05:28:04,636 INFO L175 Difference]: Start difference. First operand has 253 places, 317 transitions, 1103 flow. Second operand 8 states and 2538 transitions. [2025-02-08 05:28:04,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 388 transitions, 1791 flow [2025-02-08 05:28:04,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 388 transitions, 1779 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:04,663 INFO L231 Difference]: Finished difference. Result has 257 places, 316 transitions, 1109 flow [2025-02-08 05:28:04,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1109, PETRI_PLACES=257, PETRI_TRANSITIONS=316} [2025-02-08 05:28:04,664 INFO L279 CegarLoopForPetriNet]: 431 programPoint places, -174 predicate places. [2025-02-08 05:28:04,664 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 316 transitions, 1109 flow [2025-02-08 05:28:04,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 304.6666666666667) internal successors, (2742), 9 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:04,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:04,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:04,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:28:04,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:28:04,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2085262473, now seen corresponding path program 1 times [2025-02-08 05:28:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:04,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668594921] [2025-02-08 05:28:04,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:04,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:04,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:28:04,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:28:04,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:04,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:28:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:04,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668594921] [2025-02-08 05:28:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668594921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:04,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:04,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:28:04,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493743798] [2025-02-08 05:28:04,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:04,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:28:04,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:04,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:28:04,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:28:04,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 455 [2025-02-08 05:28:04,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 316 transitions, 1109 flow. Second operand has 5 states, 5 states have (on average 340.2) internal successors, (1701), 5 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:04,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:04,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 455 [2025-02-08 05:28:04,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:10,836 INFO L124 PetriNetUnfolderBase]: 20175/50675 cut-off events. [2025-02-08 05:28:10,836 INFO L125 PetriNetUnfolderBase]: For 30839/31485 co-relation queries the response was YES. [2025-02-08 05:28:11,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110625 conditions, 50675 events. 20175/50675 cut-off events. For 30839/31485 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 590279 event pairs, 1577 based on Foata normal form. 176/47746 useless extension candidates. Maximal degree in co-relation 110606. Up to 20131 conditions per place. [2025-02-08 05:28:11,318 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 195 selfloop transitions, 10 changer transitions 5/408 dead transitions. [2025-02-08 05:28:11,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 408 transitions, 1937 flow [2025-02-08 05:28:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:28:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:28:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1796 transitions. [2025-02-08 05:28:11,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7894505494505495 [2025-02-08 05:28:11,320 INFO L175 Difference]: Start difference. First operand has 257 places, 316 transitions, 1109 flow. Second operand 5 states and 1796 transitions. [2025-02-08 05:28:11,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 408 transitions, 1937 flow [2025-02-08 05:28:11,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 408 transitions, 1915 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:28:11,351 INFO L231 Difference]: Finished difference. Result has 256 places, 313 transitions, 1115 flow [2025-02-08 05:28:11,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1115, PETRI_PLACES=256, PETRI_TRANSITIONS=313} [2025-02-08 05:28:11,351 INFO L279 CegarLoopForPetriNet]: 431 programPoint places, -175 predicate places. [2025-02-08 05:28:11,351 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 313 transitions, 1115 flow [2025-02-08 05:28:11,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 340.2) internal successors, (1701), 5 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:11,352 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:11,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:28:11,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-02-08 05:28:11,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1914709087, now seen corresponding path program 1 times [2025-02-08 05:28:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:11,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60766989] [2025-02-08 05:28:11,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:11,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:28:11,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:28:11,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:11,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:28:11,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:11,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60766989] [2025-02-08 05:28:11,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60766989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:11,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:11,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:28:11,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767186252] [2025-02-08 05:28:11,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:11,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:28:11,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:11,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:28:11,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:28:11,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 455 [2025-02-08 05:28:11,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 313 transitions, 1115 flow. Second operand has 6 states, 6 states have (on average 320.8333333333333) internal successors, (1925), 6 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:11,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 455 [2025-02-08 05:28:11,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand