./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:44,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:44,318 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:37:44,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:44,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:44,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:44,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:44,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:44,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:44,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:44,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:44,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:44,357 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:44,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:44,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:44,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:44,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:44,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:44,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:44,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:44,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:44,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:44,358 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:44,358 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:44,358 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:44,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:44,358 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:44,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:44,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:44,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:44,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:44,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:44,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:44,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:44,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:44,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:44,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:44,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:44,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:44,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:44,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:44,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:44,361 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-02-08 05:37:44,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:44,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:44,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:44,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:44,693 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:44,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-08 05:37:46,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45dc9344e/5b7086fc7f1e447682906122d04cba6b/FLAG55ddb7682 [2025-02-08 05:37:46,309 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:46,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-08 05:37:46,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45dc9344e/5b7086fc7f1e447682906122d04cba6b/FLAG55ddb7682 [2025-02-08 05:37:46,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45dc9344e/5b7086fc7f1e447682906122d04cba6b [2025-02-08 05:37:46,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:46,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:46,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:46,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:46,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:46,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa5953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46, skipping insertion in model container [2025-02-08 05:37:46,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:46,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:46,560 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:46,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:46,616 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:46,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46 WrapperNode [2025-02-08 05:37:46,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:46,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:46,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:46,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:46,626 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:37:46" (1/1) ... [2025-02-08 05:37:46,642 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:37:46" (1/1) ... [2025-02-08 05:37:46,691 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 529 [2025-02-08 05:37:46,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:46,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:46,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:46,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:46,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:46,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:46,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:46,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:46,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:46,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:46,795 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:37:46,802 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:37:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:46,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:46,825 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:37:46,961 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:46,963 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:47,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-24: #t~ite12#1 := #t~ret11#1; [2025-02-08 05:37:47,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-25: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 05:37:47,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-26: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:47,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-27: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:47,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-28: #t~ret11#1 := minus_#res#1; [2025-02-08 05:37:47,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-24: #t~ite25#1 := #t~ret24#1; [2025-02-08 05:37:47,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-25: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647; [2025-02-08 05:37:47,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-26: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:47,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-27: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:47,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-28: #t~ret24#1 := minus_#res#1; [2025-02-08 05:37:47,780 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:47,781 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:47,817 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:47,821 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:47,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:47 BoogieIcfgContainer [2025-02-08 05:37:47,821 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:47,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:47,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:47,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:47,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:46" (1/3) ... [2025-02-08 05:37:47,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2841243e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:47, skipping insertion in model container [2025-02-08 05:37:47,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (2/3) ... [2025-02-08 05:37:47,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2841243e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:47, skipping insertion in model container [2025-02-08 05:37:47,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:47" (3/3) ... [2025-02-08 05:37:47,836 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-02-08 05:37:47,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:47,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 677 locations, 1 initial locations, 4 loop locations, and 78 error locations. [2025-02-08 05:37:47,855 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:48,030 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:37:48,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 683 places, 703 transitions, 1420 flow [2025-02-08 05:37:48,343 INFO L124 PetriNetUnfolderBase]: 27/701 cut-off events. [2025-02-08 05:37:48,347 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:48,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 701 events. 27/701 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1151 event pairs, 0 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 512. Up to 2 conditions per place. [2025-02-08 05:37:48,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 683 places, 703 transitions, 1420 flow [2025-02-08 05:37:48,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 661 places, 679 transitions, 1370 flow [2025-02-08 05:37:48,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:48,396 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;@4149e778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:48,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2025-02-08 05:37:48,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:48,402 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-08 05:37:48,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:48,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:48,403 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] [2025-02-08 05:37:48,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:48,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 862612387, now seen corresponding path program 1 times [2025-02-08 05:37:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319033579] [2025-02-08 05:37:48,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:48,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:48,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:37:48,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:37:48,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:48,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:48,607 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:37:48,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:48,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319033579] [2025-02-08 05:37:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319033579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246847709] [2025-02-08 05:37:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:48,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:48,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:48,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:48,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 703 [2025-02-08 05:37:48,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 679 transitions, 1370 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:37:48,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:48,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 703 [2025-02-08 05:37:48,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:49,032 INFO L124 PetriNetUnfolderBase]: 33/1249 cut-off events. [2025-02-08 05:37:49,033 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:37:49,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 1249 events. 33/1249 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5091 event pairs, 15 based on Foata normal form. 29/1055 useless extension candidates. Maximal degree in co-relation 919. Up to 48 conditions per place. [2025-02-08 05:37:49,049 INFO L140 encePairwiseOnDemand]: 685/703 looper letters, 17 selfloop transitions, 2 changer transitions 11/663 dead transitions. [2025-02-08 05:37:49,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 663 transitions, 1376 flow [2025-02-08 05:37:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2030 transitions. [2025-02-08 05:37:49,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625414888572783 [2025-02-08 05:37:49,120 INFO L175 Difference]: Start difference. First operand has 661 places, 679 transitions, 1370 flow. Second operand 3 states and 2030 transitions. [2025-02-08 05:37:49,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 663 transitions, 1376 flow [2025-02-08 05:37:49,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 663 transitions, 1368 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:49,151 INFO L231 Difference]: Finished difference. Result has 658 places, 652 transitions, 1312 flow [2025-02-08 05:37:49,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=658, PETRI_TRANSITIONS=652} [2025-02-08 05:37:49,159 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -3 predicate places. [2025-02-08 05:37:49,160 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 652 transitions, 1312 flow [2025-02-08 05:37:49,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:37:49,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:49,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:49,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:49,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:49,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1567959776, now seen corresponding path program 1 times [2025-02-08 05:37:49,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:49,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070191682] [2025-02-08 05:37:49,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:49,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:49,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:37:49,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:37:49,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:49,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,232 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:37:49,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070191682] [2025-02-08 05:37:49,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070191682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:49,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081778782] [2025-02-08 05:37:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:49,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 703 [2025-02-08 05:37:49,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 652 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 652.0) internal successors, (1956), 3 states have internal predecessors, (1956), 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:37:49,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 703 [2025-02-08 05:37:49,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:49,724 INFO L124 PetriNetUnfolderBase]: 83/1968 cut-off events. [2025-02-08 05:37:49,725 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-02-08 05:37:49,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1968 events. 83/1968 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 11277 event pairs, 48 based on Foata normal form. 0/1634 useless extension candidates. Maximal degree in co-relation 2071. Up to 125 conditions per place. [2025-02-08 05:37:49,742 INFO L140 encePairwiseOnDemand]: 692/703 looper letters, 24 selfloop transitions, 1 changer transitions 0/642 dead transitions. [2025-02-08 05:37:49,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 642 transitions, 1342 flow [2025-02-08 05:37:49,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1988 transitions. [2025-02-08 05:37:49,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9426268373636795 [2025-02-08 05:37:49,754 INFO L175 Difference]: Start difference. First operand has 658 places, 652 transitions, 1312 flow. Second operand 3 states and 1988 transitions. [2025-02-08 05:37:49,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 642 transitions, 1342 flow [2025-02-08 05:37:49,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 642 transitions, 1338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:49,764 INFO L231 Difference]: Finished difference. Result has 637 places, 642 transitions, 1290 flow [2025-02-08 05:37:49,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=637, PETRI_TRANSITIONS=642} [2025-02-08 05:37:49,766 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -24 predicate places. [2025-02-08 05:37:49,766 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 642 transitions, 1290 flow [2025-02-08 05:37:49,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 652.0) internal successors, (1956), 3 states have internal predecessors, (1956), 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:37:49,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:49,769 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] [2025-02-08 05:37:49,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:49,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1234705863, now seen corresponding path program 1 times [2025-02-08 05:37:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356924174] [2025-02-08 05:37:49,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:49,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:37:49,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:37:49,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:49,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,823 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:37:49,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356924174] [2025-02-08 05:37:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356924174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548597722] [2025-02-08 05:37:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:49,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 703 [2025-02-08 05:37:49,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 642 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:37:49,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 703 [2025-02-08 05:37:49,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,076 INFO L124 PetriNetUnfolderBase]: 33/1233 cut-off events. [2025-02-08 05:37:50,077 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:37:50,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 1233 events. 33/1233 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4810 event pairs, 15 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1255. Up to 48 conditions per place. [2025-02-08 05:37:50,090 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 17 selfloop transitions, 2 changer transitions 0/641 dead transitions. [2025-02-08 05:37:50,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 641 transitions, 1326 flow [2025-02-08 05:37:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-02-08 05:37:50,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9554291133238502 [2025-02-08 05:37:50,095 INFO L175 Difference]: Start difference. First operand has 637 places, 642 transitions, 1290 flow. Second operand 3 states and 2015 transitions. [2025-02-08 05:37:50,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 641 transitions, 1326 flow [2025-02-08 05:37:50,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 641 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:50,105 INFO L231 Difference]: Finished difference. Result has 637 places, 641 transitions, 1291 flow [2025-02-08 05:37:50,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=637, PETRI_TRANSITIONS=641} [2025-02-08 05:37:50,108 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -24 predicate places. [2025-02-08 05:37:50,108 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 641 transitions, 1291 flow [2025-02-08 05:37:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:37:50,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,110 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:37:50,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:50,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:50,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1667758116, now seen corresponding path program 1 times [2025-02-08 05:37:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624263555] [2025-02-08 05:37:50,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:37:50,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:37:50,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,194 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:37:50,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624263555] [2025-02-08 05:37:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624263555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223374475] [2025-02-08 05:37:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 703 [2025-02-08 05:37:50,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 641 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 652.0) internal successors, (1956), 3 states have internal predecessors, (1956), 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:37:50,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 703 [2025-02-08 05:37:50,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,619 INFO L124 PetriNetUnfolderBase]: 84/1919 cut-off events. [2025-02-08 05:37:50,619 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:37:50,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1919 events. 84/1919 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10788 event pairs, 48 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 2025. Up to 126 conditions per place. [2025-02-08 05:37:50,636 INFO L140 encePairwiseOnDemand]: 692/703 looper letters, 24 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2025-02-08 05:37:50,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 631 transitions, 1321 flow [2025-02-08 05:37:50,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1988 transitions. [2025-02-08 05:37:50,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9426268373636795 [2025-02-08 05:37:50,642 INFO L175 Difference]: Start difference. First operand has 637 places, 641 transitions, 1291 flow. Second operand 3 states and 1988 transitions. [2025-02-08 05:37:50,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 631 transitions, 1321 flow [2025-02-08 05:37:50,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 631 transitions, 1317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:50,657 INFO L231 Difference]: Finished difference. Result has 627 places, 631 transitions, 1269 flow [2025-02-08 05:37:50,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1269, PETRI_PLACES=627, PETRI_TRANSITIONS=631} [2025-02-08 05:37:50,659 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -34 predicate places. [2025-02-08 05:37:50,659 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 631 transitions, 1269 flow [2025-02-08 05:37:50,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 652.0) internal successors, (1956), 3 states have internal predecessors, (1956), 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:37:50,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:50,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:50,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1862393783, now seen corresponding path program 1 times [2025-02-08 05:37:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586808562] [2025-02-08 05:37:50,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:37:50,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:37:50,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,730 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:37:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586808562] [2025-02-08 05:37:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586808562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930152951] [2025-02-08 05:37:50,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 703 [2025-02-08 05:37:50,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 631 transitions, 1269 flow. Second operand has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:50,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 703 [2025-02-08 05:37:50,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,865 INFO L124 PetriNetUnfolderBase]: 13/774 cut-off events. [2025-02-08 05:37:50,865 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:50,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 774 events. 13/774 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1368 event pairs, 1 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 760. Up to 13 conditions per place. [2025-02-08 05:37:50,872 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/630 dead transitions. [2025-02-08 05:37:50,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 630 transitions, 1291 flow [2025-02-08 05:37:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2025-02-08 05:37:50,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9620673304883831 [2025-02-08 05:37:50,878 INFO L175 Difference]: Start difference. First operand has 627 places, 631 transitions, 1269 flow. Second operand 3 states and 2029 transitions. [2025-02-08 05:37:50,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 630 transitions, 1291 flow [2025-02-08 05:37:50,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 630 transitions, 1290 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:50,888 INFO L231 Difference]: Finished difference. Result has 627 places, 630 transitions, 1270 flow [2025-02-08 05:37:50,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1270, PETRI_PLACES=627, PETRI_TRANSITIONS=630} [2025-02-08 05:37:50,890 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -34 predicate places. [2025-02-08 05:37:50,890 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 630 transitions, 1270 flow [2025-02-08 05:37:50,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:50,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:50,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:50,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1147842753, now seen corresponding path program 1 times [2025-02-08 05:37:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856500751] [2025-02-08 05:37:50,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:37:50,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:37:50,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,947 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:37:50,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856500751] [2025-02-08 05:37:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856500751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144370916] [2025-02-08 05:37:50,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 703 [2025-02-08 05:37:50,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 630 transitions, 1270 flow. Second operand has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:50,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 703 [2025-02-08 05:37:50,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,113 INFO L124 PetriNetUnfolderBase]: 19/1061 cut-off events. [2025-02-08 05:37:51,114 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:51,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 1061 events. 19/1061 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3286 event pairs, 3 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1055. Up to 17 conditions per place. [2025-02-08 05:37:51,125 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/629 dead transitions. [2025-02-08 05:37:51,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 629 transitions, 1292 flow [2025-02-08 05:37:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2025-02-08 05:37:51,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9620673304883831 [2025-02-08 05:37:51,130 INFO L175 Difference]: Start difference. First operand has 627 places, 630 transitions, 1270 flow. Second operand 3 states and 2029 transitions. [2025-02-08 05:37:51,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 629 transitions, 1292 flow [2025-02-08 05:37:51,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 629 transitions, 1288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:51,139 INFO L231 Difference]: Finished difference. Result has 626 places, 629 transitions, 1268 flow [2025-02-08 05:37:51,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1268, PETRI_PLACES=626, PETRI_TRANSITIONS=629} [2025-02-08 05:37:51,141 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -35 predicate places. [2025-02-08 05:37:51,141 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 629 transitions, 1268 flow [2025-02-08 05:37:51,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:51,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:51,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:51,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:51,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1504838406, now seen corresponding path program 1 times [2025-02-08 05:37:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490530363] [2025-02-08 05:37:51,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:37:51,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:37:51,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,218 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:37:51,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490530363] [2025-02-08 05:37:51,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490530363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328331631] [2025-02-08 05:37:51,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 703 [2025-02-08 05:37:51,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 629 transitions, 1268 flow. Second operand has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:51,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 703 [2025-02-08 05:37:51,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,385 INFO L124 PetriNetUnfolderBase]: 19/1060 cut-off events. [2025-02-08 05:37:51,385 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:51,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 1060 events. 19/1060 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3255 event pairs, 3 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1054. Up to 17 conditions per place. [2025-02-08 05:37:51,396 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2025-02-08 05:37:51,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 628 transitions, 1290 flow [2025-02-08 05:37:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2025-02-08 05:37:51,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9620673304883831 [2025-02-08 05:37:51,402 INFO L175 Difference]: Start difference. First operand has 626 places, 629 transitions, 1268 flow. Second operand 3 states and 2029 transitions. [2025-02-08 05:37:51,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 628 transitions, 1290 flow [2025-02-08 05:37:51,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 628 transitions, 1286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:51,412 INFO L231 Difference]: Finished difference. Result has 625 places, 628 transitions, 1266 flow [2025-02-08 05:37:51,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=625, PETRI_TRANSITIONS=628} [2025-02-08 05:37:51,414 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -36 predicate places. [2025-02-08 05:37:51,414 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 628 transitions, 1266 flow [2025-02-08 05:37:51,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:51,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:51,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:51,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:51,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash -434670033, now seen corresponding path program 1 times [2025-02-08 05:37:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941414171] [2025-02-08 05:37:51,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:37:51,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:37:51,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,488 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:37:51,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941414171] [2025-02-08 05:37:51,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941414171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826739401] [2025-02-08 05:37:51,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 703 [2025-02-08 05:37:51,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 628 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:51,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 703 [2025-02-08 05:37:51,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,609 INFO L124 PetriNetUnfolderBase]: 11/642 cut-off events. [2025-02-08 05:37:51,610 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:51,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 642 events. 11/642 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1028 event pairs, 1 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 629. Up to 13 conditions per place. [2025-02-08 05:37:51,617 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/627 dead transitions. [2025-02-08 05:37:51,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 627 transitions, 1288 flow [2025-02-08 05:37:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2025-02-08 05:37:51,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9620673304883831 [2025-02-08 05:37:51,622 INFO L175 Difference]: Start difference. First operand has 625 places, 628 transitions, 1266 flow. Second operand 3 states and 2029 transitions. [2025-02-08 05:37:51,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 627 transitions, 1288 flow [2025-02-08 05:37:51,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 627 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:51,632 INFO L231 Difference]: Finished difference. Result has 624 places, 627 transitions, 1264 flow [2025-02-08 05:37:51,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=624, PETRI_TRANSITIONS=627} [2025-02-08 05:37:51,634 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -37 predicate places. [2025-02-08 05:37:51,634 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 627 transitions, 1264 flow [2025-02-08 05:37:51,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:51,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:51,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:51,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:51,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1459038374, now seen corresponding path program 1 times [2025-02-08 05:37:51,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618263213] [2025-02-08 05:37:51,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:37:51,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:37:51,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:51,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618263213] [2025-02-08 05:37:51,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618263213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708855933] [2025-02-08 05:37:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 703 [2025-02-08 05:37:51,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 627 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:51,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 703 [2025-02-08 05:37:51,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,817 INFO L124 PetriNetUnfolderBase]: 15/754 cut-off events. [2025-02-08 05:37:51,817 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:37:51,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 754 events. 15/754 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1410 event pairs, 3 based on Foata normal form. 0/663 useless extension candidates. Maximal degree in co-relation 745. Up to 17 conditions per place. [2025-02-08 05:37:51,825 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/626 dead transitions. [2025-02-08 05:37:51,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 626 transitions, 1286 flow [2025-02-08 05:37:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2025-02-08 05:37:51,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9620673304883831 [2025-02-08 05:37:51,829 INFO L175 Difference]: Start difference. First operand has 624 places, 627 transitions, 1264 flow. Second operand 3 states and 2029 transitions. [2025-02-08 05:37:51,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 626 transitions, 1286 flow [2025-02-08 05:37:51,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 626 transitions, 1282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:51,839 INFO L231 Difference]: Finished difference. Result has 623 places, 626 transitions, 1262 flow [2025-02-08 05:37:51,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1262, PETRI_PLACES=623, PETRI_TRANSITIONS=626} [2025-02-08 05:37:51,841 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -38 predicate places. [2025-02-08 05:37:51,841 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 626 transitions, 1262 flow [2025-02-08 05:37:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:51,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:51,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:51,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 738501089, now seen corresponding path program 1 times [2025-02-08 05:37:51,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816707723] [2025-02-08 05:37:51,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:37:51,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:37:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,914 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:37:51,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816707723] [2025-02-08 05:37:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816707723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292216585] [2025-02-08 05:37:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 703 [2025-02-08 05:37:51,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 626 transitions, 1262 flow. Second operand has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:51,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 703 [2025-02-08 05:37:51,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,031 INFO L124 PetriNetUnfolderBase]: 15/734 cut-off events. [2025-02-08 05:37:52,031 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:37:52,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 734 events. 15/734 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1376 event pairs, 3 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 725. Up to 17 conditions per place. [2025-02-08 05:37:52,038 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2025-02-08 05:37:52,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 625 transitions, 1284 flow [2025-02-08 05:37:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2025-02-08 05:37:52,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9620673304883831 [2025-02-08 05:37:52,043 INFO L175 Difference]: Start difference. First operand has 623 places, 626 transitions, 1262 flow. Second operand 3 states and 2029 transitions. [2025-02-08 05:37:52,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 625 transitions, 1284 flow [2025-02-08 05:37:52,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 625 transitions, 1280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,052 INFO L231 Difference]: Finished difference. Result has 622 places, 625 transitions, 1260 flow [2025-02-08 05:37:52,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=622, PETRI_TRANSITIONS=625} [2025-02-08 05:37:52,056 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -39 predicate places. [2025-02-08 05:37:52,056 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 625 transitions, 1260 flow [2025-02-08 05:37:52,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 673.3333333333334) internal successors, (2020), 3 states have internal predecessors, (2020), 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:37:52,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:52,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:52,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:52,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1310578883, now seen corresponding path program 1 times [2025-02-08 05:37:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343656347] [2025-02-08 05:37:52,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:37:52,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:37:52,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,163 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:37:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343656347] [2025-02-08 05:37:52,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343656347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907663526] [2025-02-08 05:37:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 671 out of 703 [2025-02-08 05:37:52,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 625 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 672.3333333333334) internal successors, (2017), 3 states have internal predecessors, (2017), 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:37:52,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 671 of 703 [2025-02-08 05:37:52,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,328 INFO L124 PetriNetUnfolderBase]: 24/1051 cut-off events. [2025-02-08 05:37:52,328 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:52,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 1051 events. 24/1051 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3587 event pairs, 8 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1055. Up to 28 conditions per place. [2025-02-08 05:37:52,339 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 11 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2025-02-08 05:37:52,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 624 transitions, 1284 flow [2025-02-08 05:37:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2027 transitions. [2025-02-08 05:37:52,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611190137505927 [2025-02-08 05:37:52,345 INFO L175 Difference]: Start difference. First operand has 622 places, 625 transitions, 1260 flow. Second operand 3 states and 2027 transitions. [2025-02-08 05:37:52,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 624 transitions, 1284 flow [2025-02-08 05:37:52,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 624 transitions, 1280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,354 INFO L231 Difference]: Finished difference. Result has 621 places, 624 transitions, 1258 flow [2025-02-08 05:37:52,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1258, PETRI_PLACES=621, PETRI_TRANSITIONS=624} [2025-02-08 05:37:52,356 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -40 predicate places. [2025-02-08 05:37:52,356 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 624 transitions, 1258 flow [2025-02-08 05:37:52,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 672.3333333333334) internal successors, (2017), 3 states have internal predecessors, (2017), 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:37:52,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:52,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:52,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1251805441, now seen corresponding path program 1 times [2025-02-08 05:37:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175700511] [2025-02-08 05:37:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:37:52,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:37:52,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,063 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:37:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175700511] [2025-02-08 05:37:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175700511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363443369] [2025-02-08 05:37:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:53,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:53,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 703 [2025-02-08 05:37:53,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 624 transitions, 1258 flow. Second operand has 6 states, 6 states have (on average 617.5) internal successors, (3705), 6 states have internal predecessors, (3705), 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:37:53,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 703 [2025-02-08 05:37:53,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,163 INFO L124 PetriNetUnfolderBase]: 406/3710 cut-off events. [2025-02-08 05:37:54,163 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:37:54,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 3710 events. 406/3710 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 28986 event pairs, 360 based on Foata normal form. 0/3153 useless extension candidates. Maximal degree in co-relation 4490. Up to 779 conditions per place. [2025-02-08 05:37:54,185 INFO L140 encePairwiseOnDemand]: 691/703 looper letters, 58 selfloop transitions, 10 changer transitions 0/622 dead transitions. [2025-02-08 05:37:54,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 622 transitions, 1390 flow [2025-02-08 05:37:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3766 transitions. [2025-02-08 05:37:54,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928402086296823 [2025-02-08 05:37:54,196 INFO L175 Difference]: Start difference. First operand has 621 places, 624 transitions, 1258 flow. Second operand 6 states and 3766 transitions. [2025-02-08 05:37:54,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 622 transitions, 1390 flow [2025-02-08 05:37:54,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 622 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,204 INFO L231 Difference]: Finished difference. Result has 622 places, 622 transitions, 1270 flow [2025-02-08 05:37:54,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1270, PETRI_PLACES=622, PETRI_TRANSITIONS=622} [2025-02-08 05:37:54,206 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -39 predicate places. [2025-02-08 05:37:54,207 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 622 transitions, 1270 flow [2025-02-08 05:37:54,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 617.5) internal successors, (3705), 6 states have internal predecessors, (3705), 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:37:54,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:54,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:54,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:54,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -487135177, now seen corresponding path program 1 times [2025-02-08 05:37:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604945636] [2025-02-08 05:37:54,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 05:37:54,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 05:37:54,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,292 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:37:54,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604945636] [2025-02-08 05:37:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604945636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967959221] [2025-02-08 05:37:54,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 671 out of 703 [2025-02-08 05:37:54,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 622 transitions, 1270 flow. Second operand has 3 states, 3 states have (on average 672.3333333333334) internal successors, (2017), 3 states have internal predecessors, (2017), 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:37:54,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 671 of 703 [2025-02-08 05:37:54,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,488 INFO L124 PetriNetUnfolderBase]: 24/1054 cut-off events. [2025-02-08 05:37:54,489 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:37:54,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 1054 events. 24/1054 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3254 event pairs, 8 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 1069. Up to 28 conditions per place. [2025-02-08 05:37:54,497 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 11 selfloop transitions, 2 changer transitions 0/621 dead transitions. [2025-02-08 05:37:54,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 621 transitions, 1294 flow [2025-02-08 05:37:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2027 transitions. [2025-02-08 05:37:54,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611190137505927 [2025-02-08 05:37:54,502 INFO L175 Difference]: Start difference. First operand has 622 places, 622 transitions, 1270 flow. Second operand 3 states and 2027 transitions. [2025-02-08 05:37:54,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 621 transitions, 1294 flow [2025-02-08 05:37:54,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 621 transitions, 1274 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:54,511 INFO L231 Difference]: Finished difference. Result has 618 places, 621 transitions, 1252 flow [2025-02-08 05:37:54,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=618, PETRI_TRANSITIONS=621} [2025-02-08 05:37:54,512 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -43 predicate places. [2025-02-08 05:37:54,513 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 621 transitions, 1252 flow [2025-02-08 05:37:54,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 672.3333333333334) internal successors, (2017), 3 states have internal predecessors, (2017), 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:37:54,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:54,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:54,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:54,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1795638021, now seen corresponding path program 1 times [2025-02-08 05:37:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667072990] [2025-02-08 05:37:54,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-08 05:37:54,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-08 05:37:54,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,693 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:37:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667072990] [2025-02-08 05:37:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667072990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401976002] [2025-02-08 05:37:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 703 [2025-02-08 05:37:54,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 621 transitions, 1252 flow. Second operand has 3 states, 3 states have (on average 618.0) internal successors, (1854), 3 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:54,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 703 [2025-02-08 05:37:54,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,384 INFO L124 PetriNetUnfolderBase]: 406/3707 cut-off events. [2025-02-08 05:37:55,384 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:37:55,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4522 conditions, 3707 events. 406/3707 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 28735 event pairs, 360 based on Foata normal form. 0/3153 useless extension candidates. Maximal degree in co-relation 4487. Up to 785 conditions per place. [2025-02-08 05:37:55,404 INFO L140 encePairwiseOnDemand]: 697/703 looper letters, 64 selfloop transitions, 4 changer transitions 0/619 dead transitions. [2025-02-08 05:37:55,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 619 transitions, 1384 flow [2025-02-08 05:37:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2025-02-08 05:37:55,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094357515410147 [2025-02-08 05:37:55,409 INFO L175 Difference]: Start difference. First operand has 618 places, 621 transitions, 1252 flow. Second operand 3 states and 1918 transitions. [2025-02-08 05:37:55,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 619 transitions, 1384 flow [2025-02-08 05:37:55,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 619 transitions, 1380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,418 INFO L231 Difference]: Finished difference. Result has 616 places, 619 transitions, 1252 flow [2025-02-08 05:37:55,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=616, PETRI_TRANSITIONS=619} [2025-02-08 05:37:55,421 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -45 predicate places. [2025-02-08 05:37:55,421 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 619 transitions, 1252 flow [2025-02-08 05:37:55,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 618.0) internal successors, (1854), 3 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:55,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:55,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:55,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash -768552075, now seen corresponding path program 1 times [2025-02-08 05:37:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138604728] [2025-02-08 05:37:55,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-08 05:37:55,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-08 05:37:55,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,496 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:37:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138604728] [2025-02-08 05:37:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138604728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440470043] [2025-02-08 05:37:55,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 673 out of 703 [2025-02-08 05:37:55,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 619 transitions, 1252 flow. Second operand has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 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:37:55,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 673 of 703 [2025-02-08 05:37:55,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,607 INFO L124 PetriNetUnfolderBase]: 15/765 cut-off events. [2025-02-08 05:37:55,608 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:37:55,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 765 events. 15/765 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1689 event pairs, 3 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 773. Up to 16 conditions per place. [2025-02-08 05:37:55,615 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 9 selfloop transitions, 2 changer transitions 0/618 dead transitions. [2025-02-08 05:37:55,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 618 transitions, 1272 flow [2025-02-08 05:37:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2031 transitions. [2025-02-08 05:37:55,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630156472261735 [2025-02-08 05:37:55,621 INFO L175 Difference]: Start difference. First operand has 616 places, 619 transitions, 1252 flow. Second operand 3 states and 2031 transitions. [2025-02-08 05:37:55,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 618 transitions, 1272 flow [2025-02-08 05:37:55,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 618 transitions, 1264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,683 INFO L231 Difference]: Finished difference. Result has 615 places, 618 transitions, 1246 flow [2025-02-08 05:37:55,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1246, PETRI_PLACES=615, PETRI_TRANSITIONS=618} [2025-02-08 05:37:55,685 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -46 predicate places. [2025-02-08 05:37:55,685 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 618 transitions, 1246 flow [2025-02-08 05:37:55,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 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:37:55,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:55,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:55,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash -501167581, now seen corresponding path program 1 times [2025-02-08 05:37:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521199970] [2025-02-08 05:37:55,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-08 05:37:55,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-08 05:37:55,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,785 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:37:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521199970] [2025-02-08 05:37:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521199970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869771282] [2025-02-08 05:37:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 673 out of 703 [2025-02-08 05:37:55,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 618 transitions, 1246 flow. Second operand has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 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:37:55,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 673 of 703 [2025-02-08 05:37:55,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,949 INFO L124 PetriNetUnfolderBase]: 17/864 cut-off events. [2025-02-08 05:37:55,949 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:55,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 864 events. 17/864 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1965 event pairs, 3 based on Foata normal form. 0/762 useless extension candidates. Maximal degree in co-relation 855. Up to 16 conditions per place. [2025-02-08 05:37:55,957 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 9 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2025-02-08 05:37:55,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 617 transitions, 1266 flow [2025-02-08 05:37:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2031 transitions. [2025-02-08 05:37:55,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630156472261735 [2025-02-08 05:37:55,963 INFO L175 Difference]: Start difference. First operand has 615 places, 618 transitions, 1246 flow. Second operand 3 states and 2031 transitions. [2025-02-08 05:37:55,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 617 transitions, 1266 flow [2025-02-08 05:37:55,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 617 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,973 INFO L231 Difference]: Finished difference. Result has 614 places, 617 transitions, 1244 flow [2025-02-08 05:37:55,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=614, PETRI_TRANSITIONS=617} [2025-02-08 05:37:55,975 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -47 predicate places. [2025-02-08 05:37:55,975 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 617 transitions, 1244 flow [2025-02-08 05:37:55,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 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:37:55,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:55,977 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:55,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash -717367497, now seen corresponding path program 1 times [2025-02-08 05:37:55,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666297957] [2025-02-08 05:37:55,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-08 05:37:56,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-08 05:37:56,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,085 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:37:56,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666297957] [2025-02-08 05:37:56,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666297957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206402674] [2025-02-08 05:37:56,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 669 out of 703 [2025-02-08 05:37:56,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 617 transitions, 1244 flow. Second operand has 3 states, 3 states have (on average 670.3333333333334) internal successors, (2011), 3 states have internal predecessors, (2011), 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:37:56,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 669 of 703 [2025-02-08 05:37:56,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,349 INFO L124 PetriNetUnfolderBase]: 46/1516 cut-off events. [2025-02-08 05:37:56,350 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:56,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 1516 events. 46/1516 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7008 event pairs, 19 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 1555. Up to 58 conditions per place. [2025-02-08 05:37:56,360 INFO L140 encePairwiseOnDemand]: 697/703 looper letters, 14 selfloop transitions, 2 changer transitions 0/616 dead transitions. [2025-02-08 05:37:56,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 616 transitions, 1275 flow [2025-02-08 05:37:56,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2027 transitions. [2025-02-08 05:37:56,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611190137505927 [2025-02-08 05:37:56,366 INFO L175 Difference]: Start difference. First operand has 614 places, 617 transitions, 1244 flow. Second operand 3 states and 2027 transitions. [2025-02-08 05:37:56,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 616 transitions, 1275 flow [2025-02-08 05:37:56,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 616 transitions, 1271 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:56,379 INFO L231 Difference]: Finished difference. Result has 611 places, 615 transitions, 1246 flow [2025-02-08 05:37:56,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1246, PETRI_PLACES=611, PETRI_TRANSITIONS=615} [2025-02-08 05:37:56,381 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -50 predicate places. [2025-02-08 05:37:56,381 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 615 transitions, 1246 flow [2025-02-08 05:37:56,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 670.3333333333334) internal successors, (2011), 3 states have internal predecessors, (2011), 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:37:56,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:56,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:56,382 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:56,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash 550658765, now seen corresponding path program 1 times [2025-02-08 05:37:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213355032] [2025-02-08 05:37:56,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-08 05:37:56,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-08 05:37:56,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,496 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:37:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213355032] [2025-02-08 05:37:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213355032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171146285] [2025-02-08 05:37:56,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 669 out of 703 [2025-02-08 05:37:56,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 615 transitions, 1246 flow. Second operand has 3 states, 3 states have (on average 670.6666666666666) internal successors, (2012), 3 states have internal predecessors, (2012), 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:37:56,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 669 of 703 [2025-02-08 05:37:56,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,766 INFO L124 PetriNetUnfolderBase]: 47/1507 cut-off events. [2025-02-08 05:37:56,767 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-02-08 05:37:56,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 1507 events. 47/1507 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7303 event pairs, 15 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 1553. Up to 60 conditions per place. [2025-02-08 05:37:56,774 INFO L140 encePairwiseOnDemand]: 697/703 looper letters, 14 selfloop transitions, 2 changer transitions 0/614 dead transitions. [2025-02-08 05:37:56,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 614 transitions, 1277 flow [2025-02-08 05:37:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2027 transitions. [2025-02-08 05:37:56,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611190137505927 [2025-02-08 05:37:56,779 INFO L175 Difference]: Start difference. First operand has 611 places, 615 transitions, 1246 flow. Second operand 3 states and 2027 transitions. [2025-02-08 05:37:56,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 614 transitions, 1277 flow [2025-02-08 05:37:56,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 614 transitions, 1277 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:56,788 INFO L231 Difference]: Finished difference. Result has 610 places, 613 transitions, 1252 flow [2025-02-08 05:37:56,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=610, PETRI_TRANSITIONS=613} [2025-02-08 05:37:56,790 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -51 predicate places. [2025-02-08 05:37:56,790 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 613 transitions, 1252 flow [2025-02-08 05:37:56,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 670.6666666666666) internal successors, (2012), 3 states have internal predecessors, (2012), 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:37:56,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:56,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:56,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:56,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1863100059, now seen corresponding path program 1 times [2025-02-08 05:37:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538488311] [2025-02-08 05:37:56,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-08 05:37:56,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-08 05:37:56,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:57,041 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:37:57,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538488311] [2025-02-08 05:37:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538488311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:57,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:57,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:37:57,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840147950] [2025-02-08 05:37:57,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:57,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:37:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:57,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:37:57,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:37:57,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 703 [2025-02-08 05:37:57,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 613 transitions, 1252 flow. Second operand has 7 states, 7 states have (on average 658.2857142857143) internal successors, (4608), 7 states have internal predecessors, (4608), 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:37:57,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:57,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 703 [2025-02-08 05:37:57,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:57,726 INFO L124 PetriNetUnfolderBase]: 30/1596 cut-off events. [2025-02-08 05:37:57,726 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:57,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 1596 events. 30/1596 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7560 event pairs, 0 based on Foata normal form. 1/1432 useless extension candidates. Maximal degree in co-relation 1647. Up to 29 conditions per place. [2025-02-08 05:37:57,742 INFO L140 encePairwiseOnDemand]: 693/703 looper letters, 45 selfloop transitions, 9 changer transitions 0/637 dead transitions. [2025-02-08 05:37:57,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 637 transitions, 1412 flow [2025-02-08 05:37:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:37:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 05:37:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4640 transitions. [2025-02-08 05:37:57,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428977850030481 [2025-02-08 05:37:57,750 INFO L175 Difference]: Start difference. First operand has 610 places, 613 transitions, 1252 flow. Second operand 7 states and 4640 transitions. [2025-02-08 05:37:57,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 637 transitions, 1412 flow [2025-02-08 05:37:57,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 637 transitions, 1412 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:57,761 INFO L231 Difference]: Finished difference. Result has 620 places, 619 transitions, 1309 flow [2025-02-08 05:37:57,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1309, PETRI_PLACES=620, PETRI_TRANSITIONS=619} [2025-02-08 05:37:57,762 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -41 predicate places. [2025-02-08 05:37:57,763 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 619 transitions, 1309 flow [2025-02-08 05:37:57,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 658.2857142857143) internal successors, (4608), 7 states have internal predecessors, (4608), 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:37:57,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:57,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:57,764 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:57,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:57,766 INFO L85 PathProgramCache]: Analyzing trace with hash 359462321, now seen corresponding path program 1 times [2025-02-08 05:37:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407805268] [2025-02-08 05:37:57,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:57,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-08 05:37:57,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-08 05:37:57,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:57,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:58,500 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:37:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407805268] [2025-02-08 05:37:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407805268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476961963] [2025-02-08 05:37:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:58,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:58,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:58,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:58,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:58,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 644 out of 703 [2025-02-08 05:37:58,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 619 transitions, 1309 flow. Second operand has 6 states, 6 states have (on average 645.6666666666666) internal successors, (3874), 6 states have internal predecessors, (3874), 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:37:58,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:58,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 644 of 703 [2025-02-08 05:37:58,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:59,745 INFO L124 PetriNetUnfolderBase]: 314/4752 cut-off events. [2025-02-08 05:37:59,745 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-08 05:37:59,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5434 conditions, 4752 events. 314/4752 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 40114 event pairs, 98 based on Foata normal form. 0/4162 useless extension candidates. Maximal degree in co-relation 5390. Up to 490 conditions per place. [2025-02-08 05:37:59,779 INFO L140 encePairwiseOnDemand]: 691/703 looper letters, 54 selfloop transitions, 8 changer transitions 0/639 dead transitions. [2025-02-08 05:37:59,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 639 transitions, 1477 flow [2025-02-08 05:37:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3930 transitions. [2025-02-08 05:37:59,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317211948790897 [2025-02-08 05:37:59,786 INFO L175 Difference]: Start difference. First operand has 620 places, 619 transitions, 1309 flow. Second operand 6 states and 3930 transitions. [2025-02-08 05:37:59,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 639 transitions, 1477 flow [2025-02-08 05:37:59,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 639 transitions, 1472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:59,796 INFO L231 Difference]: Finished difference. Result has 623 places, 623 transitions, 1358 flow [2025-02-08 05:37:59,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1358, PETRI_PLACES=623, PETRI_TRANSITIONS=623} [2025-02-08 05:37:59,798 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -38 predicate places. [2025-02-08 05:37:59,798 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 623 transitions, 1358 flow [2025-02-08 05:37:59,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 645.6666666666666) internal successors, (3874), 6 states have internal predecessors, (3874), 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:37:59,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:59,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:59,800 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:37:59,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash 137979571, now seen corresponding path program 1 times [2025-02-08 05:37:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943852842] [2025-02-08 05:37:59,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:59,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-08 05:37:59,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-08 05:37:59,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:59,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:59,871 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:37:59,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:59,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943852842] [2025-02-08 05:37:59,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943852842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:59,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:59,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976962278] [2025-02-08 05:37:59,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:59,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:59,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:59,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:37:59,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 623 transitions, 1358 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:37:59,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:59,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:37:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:00,326 INFO L124 PetriNetUnfolderBase]: 74/2982 cut-off events. [2025-02-08 05:38:00,327 INFO L125 PetriNetUnfolderBase]: For 21/39 co-relation queries the response was YES. [2025-02-08 05:38:00,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3215 conditions, 2982 events. 74/2982 cut-off events. For 21/39 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 22299 event pairs, 8 based on Foata normal form. 2/2634 useless extension candidates. Maximal degree in co-relation 3171. Up to 40 conditions per place. [2025-02-08 05:38:00,350 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/623 dead transitions. [2025-02-08 05:38:00,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 623 transitions, 1383 flow [2025-02-08 05:38:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:00,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:00,354 INFO L175 Difference]: Start difference. First operand has 623 places, 623 transitions, 1358 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:00,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 623 transitions, 1383 flow [2025-02-08 05:38:00,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 623 transitions, 1383 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:00,365 INFO L231 Difference]: Finished difference. Result has 624 places, 622 transitions, 1360 flow [2025-02-08 05:38:00,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1360, PETRI_PLACES=624, PETRI_TRANSITIONS=622} [2025-02-08 05:38:00,367 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -37 predicate places. [2025-02-08 05:38:00,367 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 622 transitions, 1360 flow [2025-02-08 05:38:00,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:00,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:00,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:38:00,369 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1917719353, now seen corresponding path program 1 times [2025-02-08 05:38:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:00,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828446860] [2025-02-08 05:38:00,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:00,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:00,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-08 05:38:00,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-08 05:38:00,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:00,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:01,079 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:38:01,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:01,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828446860] [2025-02-08 05:38:01,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828446860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:01,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:01,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649936744] [2025-02-08 05:38:01,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:01,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:01,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:01,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:01,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:01,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 644 out of 703 [2025-02-08 05:38:01,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 622 transitions, 1360 flow. Second operand has 6 states, 6 states have (on average 645.8333333333334) internal successors, (3875), 6 states have internal predecessors, (3875), 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:38:01,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:01,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 644 of 703 [2025-02-08 05:38:01,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:02,511 INFO L124 PetriNetUnfolderBase]: 334/5396 cut-off events. [2025-02-08 05:38:02,511 INFO L125 PetriNetUnfolderBase]: For 41/63 co-relation queries the response was YES. [2025-02-08 05:38:02,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6232 conditions, 5396 events. 334/5396 cut-off events. For 41/63 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 49027 event pairs, 96 based on Foata normal form. 0/4772 useless extension candidates. Maximal degree in co-relation 6185. Up to 530 conditions per place. [2025-02-08 05:38:02,526 INFO L140 encePairwiseOnDemand]: 691/703 looper letters, 54 selfloop transitions, 8 changer transitions 0/642 dead transitions. [2025-02-08 05:38:02,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 642 transitions, 1528 flow [2025-02-08 05:38:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3930 transitions. [2025-02-08 05:38:02,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317211948790897 [2025-02-08 05:38:02,532 INFO L175 Difference]: Start difference. First operand has 624 places, 622 transitions, 1360 flow. Second operand 6 states and 3930 transitions. [2025-02-08 05:38:02,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 642 transitions, 1528 flow [2025-02-08 05:38:02,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 642 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:02,541 INFO L231 Difference]: Finished difference. Result has 627 places, 626 transitions, 1410 flow [2025-02-08 05:38:02,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1410, PETRI_PLACES=627, PETRI_TRANSITIONS=626} [2025-02-08 05:38:02,542 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -34 predicate places. [2025-02-08 05:38:02,543 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 626 transitions, 1410 flow [2025-02-08 05:38:02,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 645.8333333333334) internal successors, (3875), 6 states have internal predecessors, (3875), 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:38:02,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:02,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:02,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:38:02,544 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:02,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1487300553, now seen corresponding path program 1 times [2025-02-08 05:38:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033555224] [2025-02-08 05:38:02,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:02,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-02-08 05:38:02,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-02-08 05:38:02,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:02,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:02,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:02,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033555224] [2025-02-08 05:38:02,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033555224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:02,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:02,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:02,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831416330] [2025-02-08 05:38:02,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:02,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:02,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:02,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:02,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:02,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 626 transitions, 1410 flow. Second operand has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:02,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:02,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:02,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:03,171 INFO L124 PetriNetUnfolderBase]: 94/3558 cut-off events. [2025-02-08 05:38:03,172 INFO L125 PetriNetUnfolderBase]: For 51/65 co-relation queries the response was YES. [2025-02-08 05:38:03,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 3558 events. 94/3558 cut-off events. For 51/65 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 28056 event pairs, 8 based on Foata normal form. 0/3144 useless extension candidates. Maximal degree in co-relation 3839. Up to 64 conditions per place. [2025-02-08 05:38:03,189 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/626 dead transitions. [2025-02-08 05:38:03,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 626 transitions, 1435 flow [2025-02-08 05:38:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:03,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:03,191 INFO L175 Difference]: Start difference. First operand has 627 places, 626 transitions, 1410 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:03,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 626 transitions, 1435 flow [2025-02-08 05:38:03,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 626 transitions, 1435 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:03,199 INFO L231 Difference]: Finished difference. Result has 628 places, 625 transitions, 1412 flow [2025-02-08 05:38:03,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1412, PETRI_PLACES=628, PETRI_TRANSITIONS=625} [2025-02-08 05:38:03,200 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -33 predicate places. [2025-02-08 05:38:03,200 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 625 transitions, 1412 flow [2025-02-08 05:38:03,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:03,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:03,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:38:03,201 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:03,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2110266715, now seen corresponding path program 1 times [2025-02-08 05:38:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:03,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180857344] [2025-02-08 05:38:03,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:03,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:03,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-08 05:38:03,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-08 05:38:03,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:03,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:03,269 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:38:03,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180857344] [2025-02-08 05:38:03,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180857344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:03,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658547520] [2025-02-08 05:38:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:03,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:03,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:03,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:03,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:03,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 625 transitions, 1412 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:03,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:03,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:03,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:03,695 INFO L124 PetriNetUnfolderBase]: 96/3520 cut-off events. [2025-02-08 05:38:03,695 INFO L125 PetriNetUnfolderBase]: For 37/49 co-relation queries the response was YES. [2025-02-08 05:38:03,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 3520 events. 96/3520 cut-off events. For 37/49 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 29268 event pairs, 8 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 3849. Up to 84 conditions per place. [2025-02-08 05:38:03,711 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2025-02-08 05:38:03,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 625 transitions, 1437 flow [2025-02-08 05:38:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:03,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:03,714 INFO L175 Difference]: Start difference. First operand has 628 places, 625 transitions, 1412 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:03,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 625 transitions, 1437 flow [2025-02-08 05:38:03,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 625 transitions, 1433 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:03,720 INFO L231 Difference]: Finished difference. Result has 627 places, 624 transitions, 1410 flow [2025-02-08 05:38:03,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1410, PETRI_PLACES=627, PETRI_TRANSITIONS=624} [2025-02-08 05:38:03,721 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -34 predicate places. [2025-02-08 05:38:03,721 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 624 transitions, 1410 flow [2025-02-08 05:38:03,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:03,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:03,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:03,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:38:03,723 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:03,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash -99588195, now seen corresponding path program 1 times [2025-02-08 05:38:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231303865] [2025-02-08 05:38:03,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:03,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-08 05:38:03,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-08 05:38:03,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:03,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:03,790 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:38:03,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231303865] [2025-02-08 05:38:03,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231303865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:03,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:03,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:03,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305908256] [2025-02-08 05:38:03,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:03,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:03,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:03,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:03,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 703 [2025-02-08 05:38:03,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 624 transitions, 1410 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:38:03,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:03,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 703 [2025-02-08 05:38:03,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:04,621 INFO L124 PetriNetUnfolderBase]: 110/5074 cut-off events. [2025-02-08 05:38:04,621 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2025-02-08 05:38:04,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5449 conditions, 5074 events. 110/5074 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 46794 event pairs, 8 based on Foata normal form. 0/4510 useless extension candidates. Maximal degree in co-relation 5400. Up to 96 conditions per place. [2025-02-08 05:38:04,673 INFO L140 encePairwiseOnDemand]: 699/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2025-02-08 05:38:04,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 625 transitions, 1437 flow [2025-02-08 05:38:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2039 transitions. [2025-02-08 05:38:04,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9668089141773353 [2025-02-08 05:38:04,679 INFO L175 Difference]: Start difference. First operand has 627 places, 624 transitions, 1410 flow. Second operand 3 states and 2039 transitions. [2025-02-08 05:38:04,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 625 transitions, 1437 flow [2025-02-08 05:38:04,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 625 transitions, 1433 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:04,694 INFO L231 Difference]: Finished difference. Result has 626 places, 624 transitions, 1416 flow [2025-02-08 05:38:04,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1416, PETRI_PLACES=626, PETRI_TRANSITIONS=624} [2025-02-08 05:38:04,695 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -35 predicate places. [2025-02-08 05:38:04,695 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 624 transitions, 1416 flow [2025-02-08 05:38:04,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:38:04,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:04,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:04,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:38:04,697 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -519879055, now seen corresponding path program 1 times [2025-02-08 05:38:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634115366] [2025-02-08 05:38:04,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:04,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-02-08 05:38:04,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-02-08 05:38:04,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:04,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:04,769 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:38:04,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634115366] [2025-02-08 05:38:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634115366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:04,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:04,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968022852] [2025-02-08 05:38:04,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:04,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:04,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:04,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:04,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:04,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 624 transitions, 1416 flow. Second operand has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:04,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:04,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:04,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:05,307 INFO L124 PetriNetUnfolderBase]: 102/4548 cut-off events. [2025-02-08 05:38:05,307 INFO L125 PetriNetUnfolderBase]: For 55/69 co-relation queries the response was YES. [2025-02-08 05:38:05,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4994 conditions, 4548 events. 102/4548 cut-off events. For 55/69 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 40778 event pairs, 8 based on Foata normal form. 0/4058 useless extension candidates. Maximal degree in co-relation 4945. Up to 116 conditions per place. [2025-02-08 05:38:05,345 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2025-02-08 05:38:05,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 624 transitions, 1441 flow [2025-02-08 05:38:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:05,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:05,348 INFO L175 Difference]: Start difference. First operand has 626 places, 624 transitions, 1416 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:05,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 624 transitions, 1441 flow [2025-02-08 05:38:05,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 624 transitions, 1441 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:05,354 INFO L231 Difference]: Finished difference. Result has 627 places, 623 transitions, 1418 flow [2025-02-08 05:38:05,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1418, PETRI_PLACES=627, PETRI_TRANSITIONS=623} [2025-02-08 05:38:05,355 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -34 predicate places. [2025-02-08 05:38:05,355 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 623 transitions, 1418 flow [2025-02-08 05:38:05,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:05,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:05,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:05,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:38:05,356 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:05,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash -264555718, now seen corresponding path program 1 times [2025-02-08 05:38:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929019186] [2025-02-08 05:38:05,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:05,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-08 05:38:05,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-08 05:38:05,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:05,484 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:38:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:05,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929019186] [2025-02-08 05:38:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929019186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:05,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052113217] [2025-02-08 05:38:05,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:05,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:05,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:05,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:05,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 662 out of 703 [2025-02-08 05:38:05,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 623 transitions, 1418 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 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:38:05,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:05,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 662 of 703 [2025-02-08 05:38:05,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,163 INFO L124 PetriNetUnfolderBase]: 114/5146 cut-off events. [2025-02-08 05:38:06,164 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2025-02-08 05:38:06,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5605 conditions, 5146 events. 114/5146 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 46913 event pairs, 8 based on Foata normal form. 0/4608 useless extension candidates. Maximal degree in co-relation 5552. Up to 100 conditions per place. [2025-02-08 05:38:06,189 INFO L140 encePairwiseOnDemand]: 699/703 looper letters, 23 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2025-02-08 05:38:06,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 624 transitions, 1471 flow [2025-02-08 05:38:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2013 transitions. [2025-02-08 05:38:06,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544807965860598 [2025-02-08 05:38:06,192 INFO L175 Difference]: Start difference. First operand has 627 places, 623 transitions, 1418 flow. Second operand 3 states and 2013 transitions. [2025-02-08 05:38:06,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 624 transitions, 1471 flow [2025-02-08 05:38:06,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 624 transitions, 1467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:06,200 INFO L231 Difference]: Finished difference. Result has 626 places, 623 transitions, 1424 flow [2025-02-08 05:38:06,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1424, PETRI_PLACES=626, PETRI_TRANSITIONS=623} [2025-02-08 05:38:06,202 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -35 predicate places. [2025-02-08 05:38:06,202 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 623 transitions, 1424 flow [2025-02-08 05:38:06,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 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:38:06,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:06,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:38:06,203 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1962239309, now seen corresponding path program 1 times [2025-02-08 05:38:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240936208] [2025-02-08 05:38:06,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-08 05:38:06,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-08 05:38:06,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,268 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:38:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240936208] [2025-02-08 05:38:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240936208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914783490] [2025-02-08 05:38:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:06,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:06,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:06,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:06,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 703 [2025-02-08 05:38:06,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 623 transitions, 1424 flow. Second operand has 3 states, 3 states have (on average 676.6666666666666) internal successors, (2030), 3 states have internal predecessors, (2030), 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:38:06,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 703 [2025-02-08 05:38:06,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:07,167 INFO L124 PetriNetUnfolderBase]: 122/6248 cut-off events. [2025-02-08 05:38:07,167 INFO L125 PetriNetUnfolderBase]: For 59/73 co-relation queries the response was YES. [2025-02-08 05:38:07,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 6248 events. 122/6248 cut-off events. For 59/73 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 62687 event pairs, 4 based on Foata normal form. 0/5608 useless extension candidates. Maximal degree in co-relation 6682. Up to 100 conditions per place. [2025-02-08 05:38:07,199 INFO L140 encePairwiseOnDemand]: 699/703 looper letters, 11 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2025-02-08 05:38:07,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 625 transitions, 1456 flow [2025-02-08 05:38:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2040 transitions. [2025-02-08 05:38:07,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672830725462305 [2025-02-08 05:38:07,201 INFO L175 Difference]: Start difference. First operand has 626 places, 623 transitions, 1424 flow. Second operand 3 states and 2040 transitions. [2025-02-08 05:38:07,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 625 transitions, 1456 flow [2025-02-08 05:38:07,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 625 transitions, 1456 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:07,209 INFO L231 Difference]: Finished difference. Result has 627 places, 623 transitions, 1434 flow [2025-02-08 05:38:07,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=627, PETRI_TRANSITIONS=623} [2025-02-08 05:38:07,209 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -34 predicate places. [2025-02-08 05:38:07,209 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 623 transitions, 1434 flow [2025-02-08 05:38:07,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.6666666666666) internal successors, (2030), 3 states have internal predecessors, (2030), 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:38:07,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:07,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:07,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:38:07,210 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1201239898, now seen corresponding path program 1 times [2025-02-08 05:38:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:07,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526327354] [2025-02-08 05:38:07,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:07,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-08 05:38:07,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-08 05:38:07,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:07,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,293 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:38:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526327354] [2025-02-08 05:38:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526327354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:07,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081975722] [2025-02-08 05:38:07,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 703 [2025-02-08 05:38:07,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 623 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:38:07,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 703 [2025-02-08 05:38:07,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:07,968 INFO L124 PetriNetUnfolderBase]: 100/5384 cut-off events. [2025-02-08 05:38:07,968 INFO L125 PetriNetUnfolderBase]: For 41/71 co-relation queries the response was YES. [2025-02-08 05:38:07,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5971 conditions, 5384 events. 100/5384 cut-off events. For 41/71 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 52340 event pairs, 10 based on Foata normal form. 2/4892 useless extension candidates. Maximal degree in co-relation 5920. Up to 109 conditions per place. [2025-02-08 05:38:07,999 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 11 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2025-02-08 05:38:07,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 625 transitions, 1465 flow [2025-02-08 05:38:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2039 transitions. [2025-02-08 05:38:08,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9668089141773353 [2025-02-08 05:38:08,001 INFO L175 Difference]: Start difference. First operand has 627 places, 623 transitions, 1434 flow. Second operand 3 states and 2039 transitions. [2025-02-08 05:38:08,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 625 transitions, 1465 flow [2025-02-08 05:38:08,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 625 transitions, 1465 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:08,010 INFO L231 Difference]: Finished difference. Result has 631 places, 624 transitions, 1448 flow [2025-02-08 05:38:08,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1448, PETRI_PLACES=631, PETRI_TRANSITIONS=624} [2025-02-08 05:38:08,012 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -30 predicate places. [2025-02-08 05:38:08,012 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 624 transitions, 1448 flow [2025-02-08 05:38:08,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:38:08,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:38:08,013 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:08,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 547264888, now seen corresponding path program 1 times [2025-02-08 05:38:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071770071] [2025-02-08 05:38:08,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:08,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:08,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-08 05:38:08,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-08 05:38:08,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:08,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:08,155 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:38:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071770071] [2025-02-08 05:38:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071770071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567118562] [2025-02-08 05:38:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:08,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:08,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:08,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 662 out of 703 [2025-02-08 05:38:08,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 624 transitions, 1448 flow. Second operand has 3 states, 3 states have (on average 664.6666666666666) internal successors, (1994), 3 states have internal predecessors, (1994), 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:38:08,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:08,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 662 of 703 [2025-02-08 05:38:08,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:08,944 INFO L124 PetriNetUnfolderBase]: 104/5736 cut-off events. [2025-02-08 05:38:08,945 INFO L125 PetriNetUnfolderBase]: For 75/87 co-relation queries the response was YES. [2025-02-08 05:38:08,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6382 conditions, 5736 events. 104/5736 cut-off events. For 75/87 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 55590 event pairs, 6 based on Foata normal form. 0/5250 useless extension candidates. Maximal degree in co-relation 6327. Up to 100 conditions per place. [2025-02-08 05:38:08,976 INFO L140 encePairwiseOnDemand]: 699/703 looper letters, 23 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2025-02-08 05:38:08,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 625 transitions, 1501 flow [2025-02-08 05:38:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2013 transitions. [2025-02-08 05:38:08,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544807965860598 [2025-02-08 05:38:08,977 INFO L175 Difference]: Start difference. First operand has 631 places, 624 transitions, 1448 flow. Second operand 3 states and 2013 transitions. [2025-02-08 05:38:08,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 625 transitions, 1501 flow [2025-02-08 05:38:08,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 625 transitions, 1499 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:08,986 INFO L231 Difference]: Finished difference. Result has 631 places, 624 transitions, 1456 flow [2025-02-08 05:38:08,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=631, PETRI_TRANSITIONS=624} [2025-02-08 05:38:08,987 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -30 predicate places. [2025-02-08 05:38:08,987 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 624 transitions, 1456 flow [2025-02-08 05:38:08,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.6666666666666) internal successors, (1994), 3 states have internal predecessors, (1994), 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:38:08,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:38:08,988 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash -831884100, now seen corresponding path program 1 times [2025-02-08 05:38:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054799450] [2025-02-08 05:38:08,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:09,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 05:38:09,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 05:38:09,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:09,050 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:38:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054799450] [2025-02-08 05:38:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054799450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:09,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:09,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730877931] [2025-02-08 05:38:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:09,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:09,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:09,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:09,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 703 [2025-02-08 05:38:09,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 624 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 676.6666666666666) internal successors, (2030), 3 states have internal predecessors, (2030), 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:38:09,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:09,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 703 [2025-02-08 05:38:09,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:09,701 INFO L124 PetriNetUnfolderBase]: 90/5018 cut-off events. [2025-02-08 05:38:09,701 INFO L125 PetriNetUnfolderBase]: For 59/73 co-relation queries the response was YES. [2025-02-08 05:38:09,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 5018 events. 90/5018 cut-off events. For 59/73 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 45264 event pairs, 10 based on Foata normal form. 0/4622 useless extension candidates. Maximal degree in co-relation 5684. Up to 115 conditions per place. [2025-02-08 05:38:09,726 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 1/626 dead transitions. [2025-02-08 05:38:09,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 626 transitions, 1487 flow [2025-02-08 05:38:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2039 transitions. [2025-02-08 05:38:09,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9668089141773353 [2025-02-08 05:38:09,728 INFO L175 Difference]: Start difference. First operand has 631 places, 624 transitions, 1456 flow. Second operand 3 states and 2039 transitions. [2025-02-08 05:38:09,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 626 transitions, 1487 flow [2025-02-08 05:38:09,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 626 transitions, 1487 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:09,733 INFO L231 Difference]: Finished difference. Result has 635 places, 625 transitions, 1470 flow [2025-02-08 05:38:09,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=635, PETRI_TRANSITIONS=625} [2025-02-08 05:38:09,734 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -26 predicate places. [2025-02-08 05:38:09,734 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 625 transitions, 1470 flow [2025-02-08 05:38:09,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.6666666666666) internal successors, (2030), 3 states have internal predecessors, (2030), 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:38:09,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:09,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:09,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:38:09,735 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:09,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash 977637109, now seen corresponding path program 1 times [2025-02-08 05:38:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186149647] [2025-02-08 05:38:09,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:09,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 05:38:09,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 05:38:09,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:09,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:09,795 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:38:09,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:09,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186149647] [2025-02-08 05:38:09,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186149647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:09,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:09,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:09,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646623213] [2025-02-08 05:38:09,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:09,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:09,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:09,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:09,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:09,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 625 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:09,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:09,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:09,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:10,560 INFO L124 PetriNetUnfolderBase]: 84/5208 cut-off events. [2025-02-08 05:38:10,560 INFO L125 PetriNetUnfolderBase]: For 75/87 co-relation queries the response was YES. [2025-02-08 05:38:10,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6020 conditions, 5208 events. 84/5208 cut-off events. For 75/87 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 48952 event pairs, 2 based on Foata normal form. 0/4874 useless extension candidates. Maximal degree in co-relation 5965. Up to 98 conditions per place. [2025-02-08 05:38:10,644 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 1 changer transitions 0/624 dead transitions. [2025-02-08 05:38:10,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 624 transitions, 1491 flow [2025-02-08 05:38:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:10,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:10,646 INFO L175 Difference]: Start difference. First operand has 635 places, 625 transitions, 1470 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:10,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 624 transitions, 1491 flow [2025-02-08 05:38:10,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 624 transitions, 1489 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:10,655 INFO L231 Difference]: Finished difference. Result has 634 places, 623 transitions, 1466 flow [2025-02-08 05:38:10,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=634, PETRI_TRANSITIONS=623} [2025-02-08 05:38:10,656 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -27 predicate places. [2025-02-08 05:38:10,657 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 623 transitions, 1466 flow [2025-02-08 05:38:10,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:10,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:10,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:10,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:38:10,658 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:10,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1088529608, now seen corresponding path program 1 times [2025-02-08 05:38:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902289604] [2025-02-08 05:38:10,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-08 05:38:10,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-08 05:38:10,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:10,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:10,720 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:38:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902289604] [2025-02-08 05:38:10,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902289604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:10,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:10,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:10,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405265418] [2025-02-08 05:38:10,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:10,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:10,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:10,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:10,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:10,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 623 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:10,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:10,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:10,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:11,307 INFO L124 PetriNetUnfolderBase]: 84/4838 cut-off events. [2025-02-08 05:38:11,307 INFO L125 PetriNetUnfolderBase]: For 41/53 co-relation queries the response was YES. [2025-02-08 05:38:11,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 4838 events. 84/4838 cut-off events. For 41/53 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 44063 event pairs, 2 based on Foata normal form. 0/4544 useless extension candidates. Maximal degree in co-relation 5565. Up to 98 conditions per place. [2025-02-08 05:38:11,334 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 1 changer transitions 0/622 dead transitions. [2025-02-08 05:38:11,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 622 transitions, 1487 flow [2025-02-08 05:38:11,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:11,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:11,336 INFO L175 Difference]: Start difference. First operand has 634 places, 623 transitions, 1466 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:11,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 622 transitions, 1487 flow [2025-02-08 05:38:11,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 622 transitions, 1486 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:11,342 INFO L231 Difference]: Finished difference. Result has 633 places, 621 transitions, 1463 flow [2025-02-08 05:38:11,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1463, PETRI_PLACES=633, PETRI_TRANSITIONS=621} [2025-02-08 05:38:11,343 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -28 predicate places. [2025-02-08 05:38:11,343 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 621 transitions, 1463 flow [2025-02-08 05:38:11,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:11,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:11,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:11,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:38:11,344 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash 431984395, now seen corresponding path program 1 times [2025-02-08 05:38:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429392728] [2025-02-08 05:38:11,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:11,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-08 05:38:11,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-08 05:38:11,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:11,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:11,403 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:38:11,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:11,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429392728] [2025-02-08 05:38:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429392728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:11,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:11,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086806078] [2025-02-08 05:38:11,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:11,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:11,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:11,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:11,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:11,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 621 transitions, 1463 flow. Second operand has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:11,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:11,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:11,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:12,096 INFO L124 PetriNetUnfolderBase]: 84/4846 cut-off events. [2025-02-08 05:38:12,097 INFO L125 PetriNetUnfolderBase]: For 53/67 co-relation queries the response was YES. [2025-02-08 05:38:12,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 4846 events. 84/4846 cut-off events. For 53/67 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 43540 event pairs, 2 based on Foata normal form. 0/4576 useless extension candidates. Maximal degree in co-relation 5579. Up to 82 conditions per place. [2025-02-08 05:38:12,119 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 1 changer transitions 0/620 dead transitions. [2025-02-08 05:38:12,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 620 transitions, 1484 flow [2025-02-08 05:38:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:12,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:12,120 INFO L175 Difference]: Start difference. First operand has 633 places, 621 transitions, 1463 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:12,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 620 transitions, 1484 flow [2025-02-08 05:38:12,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 620 transitions, 1483 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:12,125 INFO L231 Difference]: Finished difference. Result has 632 places, 619 transitions, 1460 flow [2025-02-08 05:38:12,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=632, PETRI_TRANSITIONS=619} [2025-02-08 05:38:12,126 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -29 predicate places. [2025-02-08 05:38:12,126 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 619 transitions, 1460 flow [2025-02-08 05:38:12,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:12,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:12,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:12,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:38:12,127 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:12,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1474772914, now seen corresponding path program 1 times [2025-02-08 05:38:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554434249] [2025-02-08 05:38:12,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:12,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-08 05:38:12,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-08 05:38:12,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:12,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:12,186 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:38:12,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:12,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554434249] [2025-02-08 05:38:12,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554434249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:12,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136892121] [2025-02-08 05:38:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:12,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:12,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:12,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:12,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:12,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 619 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:12,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:12,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:12,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:12,779 INFO L124 PetriNetUnfolderBase]: 84/4774 cut-off events. [2025-02-08 05:38:12,779 INFO L125 PetriNetUnfolderBase]: For 53/67 co-relation queries the response was YES. [2025-02-08 05:38:12,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 4774 events. 84/4774 cut-off events. For 53/67 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 42726 event pairs, 2 based on Foata normal form. 0/4540 useless extension candidates. Maximal degree in co-relation 5523. Up to 82 conditions per place. [2025-02-08 05:38:12,807 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 1 changer transitions 0/618 dead transitions. [2025-02-08 05:38:12,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 618 transitions, 1481 flow [2025-02-08 05:38:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:12,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:12,809 INFO L175 Difference]: Start difference. First operand has 632 places, 619 transitions, 1460 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:12,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 618 transitions, 1481 flow [2025-02-08 05:38:12,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 618 transitions, 1480 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:12,815 INFO L231 Difference]: Finished difference. Result has 631 places, 617 transitions, 1457 flow [2025-02-08 05:38:12,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1457, PETRI_PLACES=631, PETRI_TRANSITIONS=617} [2025-02-08 05:38:12,815 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -30 predicate places. [2025-02-08 05:38:12,815 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 617 transitions, 1457 flow [2025-02-08 05:38:12,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:12,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:12,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:12,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 05:38:12,816 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:12,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:12,817 INFO L85 PathProgramCache]: Analyzing trace with hash 803044871, now seen corresponding path program 1 times [2025-02-08 05:38:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:12,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854063829] [2025-02-08 05:38:12,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:12,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-02-08 05:38:12,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-02-08 05:38:12,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:12,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:12,875 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:38:12,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:12,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854063829] [2025-02-08 05:38:12,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854063829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:12,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:12,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:12,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107774662] [2025-02-08 05:38:12,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:12,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:12,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:12,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:12,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:12,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 617 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:12,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:12,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:12,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:13,655 INFO L124 PetriNetUnfolderBase]: 80/4728 cut-off events. [2025-02-08 05:38:13,655 INFO L125 PetriNetUnfolderBase]: For 41/53 co-relation queries the response was YES. [2025-02-08 05:38:13,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5544 conditions, 4728 events. 80/4728 cut-off events. For 41/53 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 42550 event pairs, 4 based on Foata normal form. 0/4520 useless extension candidates. Maximal degree in co-relation 5489. Up to 68 conditions per place. [2025-02-08 05:38:13,682 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2025-02-08 05:38:13,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 617 transitions, 1482 flow [2025-02-08 05:38:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:13,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:13,684 INFO L175 Difference]: Start difference. First operand has 631 places, 617 transitions, 1457 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:13,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 617 transitions, 1482 flow [2025-02-08 05:38:13,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 617 transitions, 1481 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:13,691 INFO L231 Difference]: Finished difference. Result has 631 places, 616 transitions, 1458 flow [2025-02-08 05:38:13,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=631, PETRI_TRANSITIONS=616} [2025-02-08 05:38:13,691 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -30 predicate places. [2025-02-08 05:38:13,692 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 616 transitions, 1458 flow [2025-02-08 05:38:13,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:38:13,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:13,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 05:38:13,693 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2009328965, now seen corresponding path program 1 times [2025-02-08 05:38:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510367915] [2025-02-08 05:38:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:13,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-08 05:38:13,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-08 05:38:13,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:13,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:13,755 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:38:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510367915] [2025-02-08 05:38:13,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510367915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:13,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:13,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096575617] [2025-02-08 05:38:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:13,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:13,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:13,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:13,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:13,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 616 transitions, 1458 flow. Second operand has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:13,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:13,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:13,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:14,315 INFO L124 PetriNetUnfolderBase]: 78/4704 cut-off events. [2025-02-08 05:38:14,315 INFO L125 PetriNetUnfolderBase]: For 51/65 co-relation queries the response was YES. [2025-02-08 05:38:14,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5542 conditions, 4704 events. 78/4704 cut-off events. For 51/65 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 42087 event pairs, 4 based on Foata normal form. 0/4508 useless extension candidates. Maximal degree in co-relation 5487. Up to 68 conditions per place. [2025-02-08 05:38:14,354 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 10 selfloop transitions, 2 changer transitions 0/616 dead transitions. [2025-02-08 05:38:14,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 616 transitions, 1483 flow [2025-02-08 05:38:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2035 transitions. [2025-02-08 05:38:14,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:38:14,356 INFO L175 Difference]: Start difference. First operand has 631 places, 616 transitions, 1458 flow. Second operand 3 states and 2035 transitions. [2025-02-08 05:38:14,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 616 transitions, 1483 flow [2025-02-08 05:38:14,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 616 transitions, 1479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:14,365 INFO L231 Difference]: Finished difference. Result has 630 places, 615 transitions, 1456 flow [2025-02-08 05:38:14,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=630, PETRI_TRANSITIONS=615} [2025-02-08 05:38:14,366 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -31 predicate places. [2025-02-08 05:38:14,366 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 615 transitions, 1456 flow [2025-02-08 05:38:14,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.0) internal successors, (2028), 3 states have internal predecessors, (2028), 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:38:14,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:14,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:14,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 05:38:14,367 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:14,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1857232807, now seen corresponding path program 1 times [2025-02-08 05:38:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:14,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289427122] [2025-02-08 05:38:14,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:14,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-02-08 05:38:14,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-02-08 05:38:14,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:14,444 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:38:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:14,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289427122] [2025-02-08 05:38:14,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289427122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:14,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:14,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:14,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453780069] [2025-02-08 05:38:14,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:14,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:14,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:14,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:14,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:14,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 615 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 676.6666666666666) internal successors, (2030), 3 states have internal predecessors, (2030), 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:38:14,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:14,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:14,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,001 INFO L124 PetriNetUnfolderBase]: 74/4676 cut-off events. [2025-02-08 05:38:15,001 INFO L125 PetriNetUnfolderBase]: For 41/55 co-relation queries the response was YES. [2025-02-08 05:38:15,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5462 conditions, 4676 events. 74/4676 cut-off events. For 41/55 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 41835 event pairs, 2 based on Foata normal form. 0/4488 useless extension candidates. Maximal degree in co-relation 5407. Up to 44 conditions per place. [2025-02-08 05:38:15,027 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 9 selfloop transitions, 1 changer transitions 0/613 dead transitions. [2025-02-08 05:38:15,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 613 transitions, 1472 flow [2025-02-08 05:38:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2034 transitions. [2025-02-08 05:38:15,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644381223328592 [2025-02-08 05:38:15,029 INFO L175 Difference]: Start difference. First operand has 630 places, 615 transitions, 1456 flow. Second operand 3 states and 2034 transitions. [2025-02-08 05:38:15,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 613 transitions, 1472 flow [2025-02-08 05:38:15,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 613 transitions, 1468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,039 INFO L231 Difference]: Finished difference. Result has 628 places, 613 transitions, 1450 flow [2025-02-08 05:38:15,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=628, PETRI_TRANSITIONS=613} [2025-02-08 05:38:15,040 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -33 predicate places. [2025-02-08 05:38:15,040 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 613 transitions, 1450 flow [2025-02-08 05:38:15,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.6666666666666) internal successors, (2030), 3 states have internal predecessors, (2030), 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:38:15,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 05:38:15,041 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-02-08 05:38:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1616958646, now seen corresponding path program 1 times [2025-02-08 05:38:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926607319] [2025-02-08 05:38:15,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-02-08 05:38:15,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-02-08 05:38:15,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:15,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:15,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926607319] [2025-02-08 05:38:15,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926607319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:15,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:15,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492379333] [2025-02-08 05:38:15,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:15,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:15,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:15,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:15,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:15,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 703 [2025-02-08 05:38:15,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 613 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 676.6666666666666) internal successors, (2030), 3 states have internal predecessors, (2030), 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:38:15,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:15,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 703 [2025-02-08 05:38:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,791 INFO L124 PetriNetUnfolderBase]: 72/4688 cut-off events. [2025-02-08 05:38:15,791 INFO L125 PetriNetUnfolderBase]: For 45/59 co-relation queries the response was YES. [2025-02-08 05:38:15,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5438 conditions, 4688 events. 72/4688 cut-off events. For 45/59 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 41764 event pairs, 2 based on Foata normal form. 2/4504 useless extension candidates. Maximal degree in co-relation 5383. Up to 44 conditions per place. [2025-02-08 05:38:15,815 INFO L140 encePairwiseOnDemand]: 700/703 looper letters, 0 selfloop transitions, 0 changer transitions 611/611 dead transitions. [2025-02-08 05:38:15,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 611 transitions, 1464 flow [2025-02-08 05:38:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2033 transitions. [2025-02-08 05:38:15,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963963963963964 [2025-02-08 05:38:15,816 INFO L175 Difference]: Start difference. First operand has 628 places, 613 transitions, 1450 flow. Second operand 3 states and 2033 transitions. [2025-02-08 05:38:15,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 611 transitions, 1464 flow [2025-02-08 05:38:15,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 611 transitions, 1463 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:15,821 INFO L231 Difference]: Finished difference. Result has 627 places, 0 transitions, 0 flow [2025-02-08 05:38:15,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=703, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=627, PETRI_TRANSITIONS=0} [2025-02-08 05:38:15,822 INFO L279 CegarLoopForPetriNet]: 661 programPoint places, -34 predicate places. [2025-02-08 05:38:15,822 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 0 transitions, 0 flow [2025-02-08 05:38:15,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.6666666666666) internal successors, (2030), 3 states have internal predecessors, (2030), 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:38:15,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (129 of 130 remaining) [2025-02-08 05:38:15,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (128 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (127 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (126 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (125 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (124 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (123 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (122 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (121 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (120 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (119 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (118 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (115 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (114 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (113 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (112 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (111 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (110 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (109 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (108 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (107 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (106 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (105 of 130 remaining) [2025-02-08 05:38:15,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (104 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (103 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (102 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (101 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (100 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (99 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (98 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (97 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (96 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (95 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (94 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (93 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (92 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (91 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (90 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (89 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (88 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (87 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (86 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (85 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (84 of 130 remaining) [2025-02-08 05:38:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (83 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (82 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (81 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (80 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (79 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (78 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (77 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (76 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (75 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (74 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (73 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (72 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (71 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (70 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (69 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (68 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (67 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (65 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (64 of 130 remaining) [2025-02-08 05:38:15,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 130 remaining) [2025-02-08 05:38:15,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (62 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (61 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (60 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (59 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (58 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (57 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (56 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (55 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (52 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (49 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (48 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (47 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (46 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (45 of 130 remaining) [2025-02-08 05:38:15,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (44 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (43 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (42 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (41 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (40 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (39 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (38 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (36 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (34 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (32 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (29 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (27 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (24 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 130 remaining) [2025-02-08 05:38:15,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (21 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (20 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 130 remaining) [2025-02-08 05:38:15,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 130 remaining) [2025-02-08 05:38:15,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (11 of 130 remaining) [2025-02-08 05:38:15,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (10 of 130 remaining) [2025-02-08 05:38:15,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 130 remaining) [2025-02-08 05:38:15,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (8 of 130 remaining) [2025-02-08 05:38:15,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (7 of 130 remaining) [2025-02-08 05:38:15,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 130 remaining) [2025-02-08 05:38:15,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 130 remaining) [2025-02-08 05:38:15,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 130 remaining) [2025-02-08 05:38:15,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 130 remaining) [2025-02-08 05:38:15,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 130 remaining) [2025-02-08 05:38:15,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 130 remaining) [2025-02-08 05:38:15,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (0 of 130 remaining) [2025-02-08 05:38:15,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 05:38:15,835 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:15,840 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:38:15,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:38:15,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:38:15 BasicIcfg [2025-02-08 05:38:15,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:38:15,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:38:15,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:38:15,849 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:38:15,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:47" (3/4) ... [2025-02-08 05:38:15,851 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:38:15,854 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:38:15,854 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:38:15,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-02-08 05:38:15,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:38:15,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:38:15,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:38:15,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:38:15,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:38:15,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:38:15,979 INFO L158 Benchmark]: Toolchain (without parser) took 29645.54ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 130.0MB in the beginning and 660.4MB in the end (delta: -530.4MB). Peak memory consumption was 765.0MB. Max. memory is 16.1GB. [2025-02-08 05:38:15,979 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:15,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.25ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 116.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:38:15,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.51ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:15,982 INFO L158 Benchmark]: Boogie Preprocessor took 67.86ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:15,982 INFO L158 Benchmark]: IcfgBuilder took 1060.62ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 62.8MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 05:38:15,985 INFO L158 Benchmark]: TraceAbstraction took 28025.32ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 62.0MB in the beginning and 668.8MB in the end (delta: -606.8MB). Peak memory consumption was 689.5MB. Max. memory is 16.1GB. [2025-02-08 05:38:15,985 INFO L158 Benchmark]: Witness Printer took 128.64ms. Allocated memory is still 1.5GB. Free memory was 668.8MB in the beginning and 660.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:15,986 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.25ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 116.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.51ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.86ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1060.62ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 62.8MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 28025.32ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 62.0MB in the beginning and 668.8MB in the end (delta: -606.8MB). Peak memory consumption was 689.5MB. Max. memory is 16.1GB. * Witness Printer took 128.64ms. Allocated memory is still 1.5GB. Free memory was 668.8MB in the beginning and 660.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 969 locations, 130 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.8s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2686 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1262 mSDsluCounter, 682 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 534 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3547 IncrementalHoareTripleChecker+Invalid, 4081 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 534 mSolverCounterUnsat, 214 mSDtfsCounter, 3547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1470occurred in iteration=31, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 8741 NumberOfCodeBlocks, 8741 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 8702 ConstructedInterpolants, 0 QuantifiedInterpolants, 9201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:38:16,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE