./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.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-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:42,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:42,633 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:42,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:42,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:42,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:42,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:42,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:42,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:42,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:42,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:42,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:42,670 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:42,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:42,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:42,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:42,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:42,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:42,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:42,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:42,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:42,676 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-02-08 05:37:42,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:42,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:42,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:42,997 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:42,997 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:43,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-02-08 05:37:44,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8756c8de9/e29c957921904213a85a99431448e757/FLAG4c04a4650 [2025-02-08 05:37:44,485 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:44,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-02-08 05:37:44,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8756c8de9/e29c957921904213a85a99431448e757/FLAG4c04a4650 [2025-02-08 05:37:44,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8756c8de9/e29c957921904213a85a99431448e757 [2025-02-08 05:37:44,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:44,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:44,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:44,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:44,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:44,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:44" (1/1) ... [2025-02-08 05:37:44,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5967f0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:44, skipping insertion in model container [2025-02-08 05:37:44,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:44" (1/1) ... [2025-02-08 05:37:44,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:44,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:44,988 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:45,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:45,065 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:45,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:45 WrapperNode [2025-02-08 05:37:45,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:45,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:45,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:45,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:45,076 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:45" (1/1) ... [2025-02-08 05:37:45,094 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:45" (1/1) ... [2025-02-08 05:37:45,141 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 779 [2025-02-08 05:37:45,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:45,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:45,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:45,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:45,157 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:45" (1/1) ... [2025-02-08 05:37:45,157 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:45" (1/1) ... [2025-02-08 05:37:45,165 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:45" (1/1) ... [2025-02-08 05:37:45,166 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:45" (1/1) ... [2025-02-08 05:37:45,194 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:45" (1/1) ... [2025-02-08 05:37:45,196 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:45" (1/1) ... [2025-02-08 05:37:45,198 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:45" (1/1) ... [2025-02-08 05:37:45,203 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:45" (1/1) ... [2025-02-08 05:37:45,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:45,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:45,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:45,212 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:45,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:45" (1/1) ... [2025-02-08 05:37:45,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:45,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:45,253 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:45,259 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:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:45,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:45,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:45,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:45,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:45,282 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:45,376 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:45,378 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:45,574 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-24: #t~ite12#1 := #t~ret11#1; [2025-02-08 05:37:45,575 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:45,575 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-26: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:45,575 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-27: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:45,575 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-28: #t~ret11#1 := minus_#res#1; [2025-02-08 05:37:45,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-24: #t~ite25#1 := #t~ret24#1; [2025-02-08 05:37:45,729 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:45,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-26: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:45,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-27: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:45,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-28: #t~ret24#1 := minus_#res#1; [2025-02-08 05:37:45,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-24: #t~ite38#1 := #t~ret37#1; [2025-02-08 05:37:45,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-25: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647; [2025-02-08 05:37:45,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-26: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:45,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-27: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:45,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-28: #t~ret37#1 := minus_#res#1; [2025-02-08 05:37:46,164 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:46,165 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:46,186 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:46,186 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:46,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:46 BoogieIcfgContainer [2025-02-08 05:37:46,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:46,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:46,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:46,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:46,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:44" (1/3) ... [2025-02-08 05:37:46,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e9866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:46, skipping insertion in model container [2025-02-08 05:37:46,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:45" (2/3) ... [2025-02-08 05:37:46,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e9866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:46, skipping insertion in model container [2025-02-08 05:37:46,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:46" (3/3) ... [2025-02-08 05:37:46,193 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-02-08 05:37:46,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:46,205 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 995 locations, 1 initial locations, 6 loop locations, and 116 error locations. [2025-02-08 05:37:46,205 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:46,348 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:46,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1004 places, 1033 transitions, 2087 flow [2025-02-08 05:37:46,714 INFO L124 PetriNetUnfolderBase]: 39/1030 cut-off events. [2025-02-08 05:37:46,719 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:46,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 1030 events. 39/1030 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2224 event pairs, 0 based on Foata normal form. 0/872 useless extension candidates. Maximal degree in co-relation 839. Up to 2 conditions per place. [2025-02-08 05:37:46,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 1004 places, 1033 transitions, 2087 flow [2025-02-08 05:37:46,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 981 places, 1007 transitions, 2032 flow [2025-02-08 05:37:46,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:46,773 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;@3d2e7c7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:46,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 194 error locations. [2025-02-08 05:37:46,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:46,780 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-02-08 05:37:46,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:46,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:46,781 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] [2025-02-08 05:37:46,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:46,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1882888212, now seen corresponding path program 1 times [2025-02-08 05:37:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028966816] [2025-02-08 05:37:46,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:46,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:37:46,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:37:46,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:46,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:46,943 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:46,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:46,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028966816] [2025-02-08 05:37:46,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028966816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:46,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:46,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915543495] [2025-02-08 05:37:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:46,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:46,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:46,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:47,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1033 [2025-02-08 05:37:47,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 1007 transitions, 2032 flow. Second operand has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:47,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:47,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1033 [2025-02-08 05:37:47,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:47,668 INFO L124 PetriNetUnfolderBase]: 73/2443 cut-off events. [2025-02-08 05:37:47,669 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:37:47,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 2443 events. 73/2443 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13982 event pairs, 39 based on Foata normal form. 62/2054 useless extension candidates. Maximal degree in co-relation 1877. Up to 89 conditions per place. [2025-02-08 05:37:47,707 INFO L140 encePairwiseOnDemand]: 1008/1033 looper letters, 19 selfloop transitions, 2 changer transitions 16/984 dead transitions. [2025-02-08 05:37:47,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 984 transitions, 2028 flow [2025-02-08 05:37:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3002 transitions. [2025-02-08 05:37:47,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686995805098418 [2025-02-08 05:37:47,733 INFO L175 Difference]: Start difference. First operand has 981 places, 1007 transitions, 2032 flow. Second operand 3 states and 3002 transitions. [2025-02-08 05:37:47,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 984 transitions, 2028 flow [2025-02-08 05:37:47,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 984 transitions, 2016 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:47,755 INFO L231 Difference]: Finished difference. Result has 976 places, 968 transitions, 1946 flow [2025-02-08 05:37:47,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1946, PETRI_PLACES=976, PETRI_TRANSITIONS=968} [2025-02-08 05:37:47,760 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -5 predicate places. [2025-02-08 05:37:47,761 INFO L471 AbstractCegarLoop]: Abstraction has has 976 places, 968 transitions, 1946 flow [2025-02-08 05:37:47,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:47,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:47,762 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] [2025-02-08 05:37:47,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:47,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash 627053071, now seen corresponding path program 1 times [2025-02-08 05:37:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474630402] [2025-02-08 05:37:47,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:47,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:47,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:37:47,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:37:47,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:47,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:47,797 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:47,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:47,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474630402] [2025-02-08 05:37:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474630402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:47,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545865315] [2025-02-08 05:37:47,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:47,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:47,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:47,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:47,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 972 out of 1033 [2025-02-08 05:37:47,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 968 transitions, 1946 flow. Second operand has 3 states, 3 states have (on average 973.0) internal successors, (2919), 3 states have internal predecessors, (2919), 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:47,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:47,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 972 of 1033 [2025-02-08 05:37:47,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:48,504 INFO L124 PetriNetUnfolderBase]: 186/3716 cut-off events. [2025-02-08 05:37:48,504 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:48,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 3716 events. 186/3716 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 27801 event pairs, 132 based on Foata normal form. 0/3082 useless extension candidates. Maximal degree in co-relation 3990. Up to 254 conditions per place. [2025-02-08 05:37:48,542 INFO L140 encePairwiseOnDemand]: 1022/1033 looper letters, 26 selfloop transitions, 1 changer transitions 0/958 dead transitions. [2025-02-08 05:37:48,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 958 transitions, 1980 flow [2025-02-08 05:37:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2953 transitions. [2025-02-08 05:37:48,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528880283962569 [2025-02-08 05:37:48,551 INFO L175 Difference]: Start difference. First operand has 976 places, 968 transitions, 1946 flow. Second operand 3 states and 2953 transitions. [2025-02-08 05:37:48,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 952 places, 958 transitions, 1980 flow [2025-02-08 05:37:48,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 958 transitions, 1976 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:48,568 INFO L231 Difference]: Finished difference. Result has 950 places, 958 transitions, 1924 flow [2025-02-08 05:37:48,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1924, PETRI_PLACES=950, PETRI_TRANSITIONS=958} [2025-02-08 05:37:48,571 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -31 predicate places. [2025-02-08 05:37:48,571 INFO L471 AbstractCegarLoop]: Abstraction has has 950 places, 958 transitions, 1924 flow [2025-02-08 05:37:48,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 973.0) internal successors, (2919), 3 states have internal predecessors, (2919), 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,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:48,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:48,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:48,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:48,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 759300578, now seen corresponding path program 1 times [2025-02-08 05:37:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:48,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198442770] [2025-02-08 05:37:48,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:48,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:48,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:37:48,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:37:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:48,653 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,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:48,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198442770] [2025-02-08 05:37:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198442770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:48,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:48,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:48,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371475183] [2025-02-08 05:37:48,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:48,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:48,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:48,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:48,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:48,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1033 [2025-02-08 05:37:48,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 958 transitions, 1924 flow. Second operand has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:48,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1033 [2025-02-08 05:37:48,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:49,190 INFO L124 PetriNetUnfolderBase]: 51/2156 cut-off events. [2025-02-08 05:37:49,191 INFO L125 PetriNetUnfolderBase]: For 9/16 co-relation queries the response was YES. [2025-02-08 05:37:49,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2232 conditions, 2156 events. 51/2156 cut-off events. For 9/16 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 10919 event pairs, 21 based on Foata normal form. 0/1790 useless extension candidates. Maximal degree in co-relation 2189. Up to 62 conditions per place. [2025-02-08 05:37:49,225 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 19 selfloop transitions, 2 changer transitions 0/957 dead transitions. [2025-02-08 05:37:49,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 957 transitions, 1964 flow [2025-02-08 05:37:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-02-08 05:37:49,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616005162955792 [2025-02-08 05:37:49,231 INFO L175 Difference]: Start difference. First operand has 950 places, 958 transitions, 1924 flow. Second operand 3 states and 2980 transitions. [2025-02-08 05:37:49,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 951 places, 957 transitions, 1964 flow [2025-02-08 05:37:49,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 957 transitions, 1963 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:49,249 INFO L231 Difference]: Finished difference. Result has 950 places, 957 transitions, 1925 flow [2025-02-08 05:37:49,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1925, PETRI_PLACES=950, PETRI_TRANSITIONS=957} [2025-02-08 05:37:49,252 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -31 predicate places. [2025-02-08 05:37:49,252 INFO L471 AbstractCegarLoop]: Abstraction has has 950 places, 957 transitions, 1925 flow [2025-02-08 05:37:49,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:49,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:49,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:49,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:49,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash -654678046, now seen corresponding path program 1 times [2025-02-08 05:37:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:49,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064175947] [2025-02-08 05:37:49,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:49,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:49,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:37:49,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:37:49,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:49,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:49,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064175947] [2025-02-08 05:37:49,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064175947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:49,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414728008] [2025-02-08 05:37:49,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:49,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 972 out of 1033 [2025-02-08 05:37:49,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 957 transitions, 1925 flow. Second operand has 3 states, 3 states have (on average 973.0) internal successors, (2919), 3 states have internal predecessors, (2919), 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,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 972 of 1033 [2025-02-08 05:37:49,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:49,961 INFO L124 PetriNetUnfolderBase]: 98/2483 cut-off events. [2025-02-08 05:37:49,961 INFO L125 PetriNetUnfolderBase]: For 14/116 co-relation queries the response was YES. [2025-02-08 05:37:49,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2483 events. 98/2483 cut-off events. For 14/116 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 14988 event pairs, 60 based on Foata normal form. 0/2085 useless extension candidates. Maximal degree in co-relation 2609. Up to 146 conditions per place. [2025-02-08 05:37:50,005 INFO L140 encePairwiseOnDemand]: 1022/1033 looper letters, 26 selfloop transitions, 1 changer transitions 0/947 dead transitions. [2025-02-08 05:37:50,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 947 transitions, 1959 flow [2025-02-08 05:37:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2953 transitions. [2025-02-08 05:37:50,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528880283962569 [2025-02-08 05:37:50,011 INFO L175 Difference]: Start difference. First operand has 950 places, 957 transitions, 1925 flow. Second operand 3 states and 2953 transitions. [2025-02-08 05:37:50,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 947 transitions, 1959 flow [2025-02-08 05:37:50,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 947 transitions, 1955 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:50,022 INFO L231 Difference]: Finished difference. Result has 940 places, 947 transitions, 1903 flow [2025-02-08 05:37:50,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=940, PETRI_TRANSITIONS=947} [2025-02-08 05:37:50,024 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -41 predicate places. [2025-02-08 05:37:50,024 INFO L471 AbstractCegarLoop]: Abstraction has has 940 places, 947 transitions, 1903 flow [2025-02-08 05:37:50,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 973.0) internal successors, (2919), 3 states have internal predecessors, (2919), 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,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,026 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] [2025-02-08 05:37:50,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:50,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:50,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,027 INFO L85 PathProgramCache]: Analyzing trace with hash 376124560, now seen corresponding path program 1 times [2025-02-08 05:37:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323858792] [2025-02-08 05:37:50,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:37:50,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:37:50,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,090 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,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323858792] [2025-02-08 05:37:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323858792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439228229] [2025-02-08 05:37:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1033 [2025-02-08 05:37:50,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 947 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1033 [2025-02-08 05:37:50,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,646 INFO L124 PetriNetUnfolderBase]: 65/1792 cut-off events. [2025-02-08 05:37:50,646 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-02-08 05:37:50,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 1792 events. 65/1792 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8238 event pairs, 39 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 1850. Up to 89 conditions per place. [2025-02-08 05:37:50,692 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 19 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2025-02-08 05:37:50,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 946 transitions, 1943 flow [2025-02-08 05:37:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-02-08 05:37:50,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616005162955792 [2025-02-08 05:37:50,705 INFO L175 Difference]: Start difference. First operand has 940 places, 947 transitions, 1903 flow. Second operand 3 states and 2980 transitions. [2025-02-08 05:37:50,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 946 transitions, 1943 flow [2025-02-08 05:37:50,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 946 transitions, 1942 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:50,726 INFO L231 Difference]: Finished difference. Result has 940 places, 946 transitions, 1904 flow [2025-02-08 05:37:50,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=940, PETRI_TRANSITIONS=946} [2025-02-08 05:37:50,728 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -41 predicate places. [2025-02-08 05:37:50,732 INFO L471 AbstractCegarLoop]: Abstraction has has 940 places, 946 transitions, 1904 flow [2025-02-08 05:37:50,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:50,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:50,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:50,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -799206198, now seen corresponding path program 1 times [2025-02-08 05:37:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714303005] [2025-02-08 05:37:50,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:37:50,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:37:50,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,792 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,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714303005] [2025-02-08 05:37:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714303005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701242454] [2025-02-08 05:37:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 972 out of 1033 [2025-02-08 05:37:50,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 946 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 973.0) internal successors, (2919), 3 states have internal predecessors, (2919), 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,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 972 of 1033 [2025-02-08 05:37:50,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,349 INFO L124 PetriNetUnfolderBase]: 200/3497 cut-off events. [2025-02-08 05:37:51,349 INFO L125 PetriNetUnfolderBase]: For 64/93 co-relation queries the response was YES. [2025-02-08 05:37:51,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 3497 events. 200/3497 cut-off events. For 64/93 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 25153 event pairs, 132 based on Foata normal form. 0/2952 useless extension candidates. Maximal degree in co-relation 3745. Up to 273 conditions per place. [2025-02-08 05:37:51,383 INFO L140 encePairwiseOnDemand]: 1022/1033 looper letters, 26 selfloop transitions, 1 changer transitions 0/936 dead transitions. [2025-02-08 05:37:51,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 936 transitions, 1938 flow [2025-02-08 05:37:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2953 transitions. [2025-02-08 05:37:51,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528880283962569 [2025-02-08 05:37:51,388 INFO L175 Difference]: Start difference. First operand has 940 places, 946 transitions, 1904 flow. Second operand 3 states and 2953 transitions. [2025-02-08 05:37:51,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 936 transitions, 1938 flow [2025-02-08 05:37:51,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 936 transitions, 1934 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:51,397 INFO L231 Difference]: Finished difference. Result has 930 places, 936 transitions, 1882 flow [2025-02-08 05:37:51,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1882, PETRI_PLACES=930, PETRI_TRANSITIONS=936} [2025-02-08 05:37:51,398 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -51 predicate places. [2025-02-08 05:37:51,399 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 936 transitions, 1882 flow [2025-02-08 05:37:51,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 973.0) internal successors, (2919), 3 states have internal predecessors, (2919), 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,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,400 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] [2025-02-08 05:37:51,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:51,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:51,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,401 INFO L85 PathProgramCache]: Analyzing trace with hash -614288694, now seen corresponding path program 1 times [2025-02-08 05:37:51,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267026607] [2025-02-08 05:37:51,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:37:51,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:37:51,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,454 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,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267026607] [2025-02-08 05:37:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267026607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117795496] [2025-02-08 05:37:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 994 out of 1033 [2025-02-08 05:37:51,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 936 transitions, 1882 flow. Second operand has 3 states, 3 states have (on average 995.3333333333334) internal successors, (2986), 3 states have internal predecessors, (2986), 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,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 994 of 1033 [2025-02-08 05:37:51,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,609 INFO L124 PetriNetUnfolderBase]: 20/1226 cut-off events. [2025-02-08 05:37:51,609 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:51,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1226 events. 20/1226 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3190 event pairs, 2 based on Foata normal form. 0/1072 useless extension candidates. Maximal degree in co-relation 1211. Up to 16 conditions per place. [2025-02-08 05:37:51,623 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 11 selfloop transitions, 2 changer transitions 0/935 dead transitions. [2025-02-08 05:37:51,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 935 transitions, 1906 flow [2025-02-08 05:37:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2996 transitions. [2025-02-08 05:37:51,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667634720877702 [2025-02-08 05:37:51,628 INFO L175 Difference]: Start difference. First operand has 930 places, 936 transitions, 1882 flow. Second operand 3 states and 2996 transitions. [2025-02-08 05:37:51,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 935 transitions, 1906 flow [2025-02-08 05:37:51,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 935 transitions, 1905 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:51,639 INFO L231 Difference]: Finished difference. Result has 930 places, 935 transitions, 1883 flow [2025-02-08 05:37:51,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1879, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1883, PETRI_PLACES=930, PETRI_TRANSITIONS=935} [2025-02-08 05:37:51,642 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -51 predicate places. [2025-02-08 05:37:51,642 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 935 transitions, 1883 flow [2025-02-08 05:37:51,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 995.3333333333334) internal successors, (2986), 3 states have internal predecessors, (2986), 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,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,643 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] [2025-02-08 05:37:51,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:51,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:51,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1447139345, now seen corresponding path program 1 times [2025-02-08 05:37:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559601791] [2025-02-08 05:37:51,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:37:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:37:51,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,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:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559601791] [2025-02-08 05:37:51,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559601791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193558096] [2025-02-08 05:37:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 993 out of 1033 [2025-02-08 05:37:51,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 935 transitions, 1883 flow. Second operand has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 993 of 1033 [2025-02-08 05:37:51,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,053 INFO L124 PetriNetUnfolderBase]: 32/1807 cut-off events. [2025-02-08 05:37:52,053 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:37:52,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 1807 events. 32/1807 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8048 event pairs, 6 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 1807. Up to 25 conditions per place. [2025-02-08 05:37:52,104 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 12 selfloop transitions, 2 changer transitions 0/934 dead transitions. [2025-02-08 05:37:52,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 934 transitions, 1909 flow [2025-02-08 05:37:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2994 transitions. [2025-02-08 05:37:52,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661181026137464 [2025-02-08 05:37:52,114 INFO L175 Difference]: Start difference. First operand has 930 places, 935 transitions, 1883 flow. Second operand 3 states and 2994 transitions. [2025-02-08 05:37:52,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 934 transitions, 1909 flow [2025-02-08 05:37:52,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 934 transitions, 1905 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,135 INFO L231 Difference]: Finished difference. Result has 929 places, 934 transitions, 1881 flow [2025-02-08 05:37:52,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1881, PETRI_PLACES=929, PETRI_TRANSITIONS=934} [2025-02-08 05:37:52,141 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -52 predicate places. [2025-02-08 05:37:52,141 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 934 transitions, 1881 flow [2025-02-08 05:37:52,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,143 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] [2025-02-08 05:37:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:52,143 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1171230976, now seen corresponding path program 1 times [2025-02-08 05:37:52,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792747732] [2025-02-08 05:37:52,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:37:52,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:37:52,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,203 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,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792747732] [2025-02-08 05:37:52,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792747732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743645515] [2025-02-08 05:37:52,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 993 out of 1033 [2025-02-08 05:37:52,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 934 transitions, 1881 flow. Second operand has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 993 of 1033 [2025-02-08 05:37:52,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,579 INFO L124 PetriNetUnfolderBase]: 32/1806 cut-off events. [2025-02-08 05:37:52,580 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:37:52,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1806 events. 32/1806 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 8042 event pairs, 6 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 1806. Up to 25 conditions per place. [2025-02-08 05:37:52,603 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 12 selfloop transitions, 2 changer transitions 0/933 dead transitions. [2025-02-08 05:37:52,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 933 transitions, 1907 flow [2025-02-08 05:37:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2994 transitions. [2025-02-08 05:37:52,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661181026137464 [2025-02-08 05:37:52,608 INFO L175 Difference]: Start difference. First operand has 929 places, 934 transitions, 1881 flow. Second operand 3 states and 2994 transitions. [2025-02-08 05:37:52,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 933 transitions, 1907 flow [2025-02-08 05:37:52,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 933 transitions, 1903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,619 INFO L231 Difference]: Finished difference. Result has 928 places, 933 transitions, 1879 flow [2025-02-08 05:37:52,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=928, PETRI_TRANSITIONS=933} [2025-02-08 05:37:52,620 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -53 predicate places. [2025-02-08 05:37:52,620 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 933 transitions, 1879 flow [2025-02-08 05:37:52,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,622 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] [2025-02-08 05:37:52,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:52,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:52,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1088740354, now seen corresponding path program 1 times [2025-02-08 05:37:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868549648] [2025-02-08 05:37:52,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:37:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:37:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,671 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,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868549648] [2025-02-08 05:37:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868549648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52079028] [2025-02-08 05:37:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 993 out of 1033 [2025-02-08 05:37:52,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 933 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 993 of 1033 [2025-02-08 05:37:52,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,874 INFO L124 PetriNetUnfolderBase]: 18/1078 cut-off events. [2025-02-08 05:37:52,874 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:52,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 1078 events. 18/1078 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2461 event pairs, 2 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1065. Up to 17 conditions per place. [2025-02-08 05:37:52,888 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 12 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2025-02-08 05:37:52,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 932 transitions, 1905 flow [2025-02-08 05:37:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2994 transitions. [2025-02-08 05:37:52,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661181026137464 [2025-02-08 05:37:52,894 INFO L175 Difference]: Start difference. First operand has 928 places, 933 transitions, 1879 flow. Second operand 3 states and 2994 transitions. [2025-02-08 05:37:52,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 932 transitions, 1905 flow [2025-02-08 05:37:52,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 932 transitions, 1901 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,906 INFO L231 Difference]: Finished difference. Result has 927 places, 932 transitions, 1877 flow [2025-02-08 05:37:52,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=925, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1877, PETRI_PLACES=927, PETRI_TRANSITIONS=932} [2025-02-08 05:37:52,907 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -54 predicate places. [2025-02-08 05:37:52,907 INFO L471 AbstractCegarLoop]: Abstraction has has 927 places, 932 transitions, 1877 flow [2025-02-08 05:37:52,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,909 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] [2025-02-08 05:37:52,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:52,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:52,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash -429083205, now seen corresponding path program 1 times [2025-02-08 05:37:52,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052532672] [2025-02-08 05:37:52,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:37:52,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:37:52,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,943 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,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052532672] [2025-02-08 05:37:52,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052532672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571752103] [2025-02-08 05:37:52,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 993 out of 1033 [2025-02-08 05:37:52,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 932 transitions, 1877 flow. Second operand has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 993 of 1033 [2025-02-08 05:37:52,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,165 INFO L124 PetriNetUnfolderBase]: 26/1369 cut-off events. [2025-02-08 05:37:53,165 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-02-08 05:37:53,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 1369 events. 26/1369 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4700 event pairs, 6 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 1366. Up to 25 conditions per place. [2025-02-08 05:37:53,187 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 12 selfloop transitions, 2 changer transitions 0/931 dead transitions. [2025-02-08 05:37:53,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 928 places, 931 transitions, 1903 flow [2025-02-08 05:37:53,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2994 transitions. [2025-02-08 05:37:53,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661181026137464 [2025-02-08 05:37:53,191 INFO L175 Difference]: Start difference. First operand has 927 places, 932 transitions, 1877 flow. Second operand 3 states and 2994 transitions. [2025-02-08 05:37:53,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 928 places, 931 transitions, 1903 flow [2025-02-08 05:37:53,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 926 places, 931 transitions, 1899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,201 INFO L231 Difference]: Finished difference. Result has 926 places, 931 transitions, 1875 flow [2025-02-08 05:37:53,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=924, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1875, PETRI_PLACES=926, PETRI_TRANSITIONS=931} [2025-02-08 05:37:53,203 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -55 predicate places. [2025-02-08 05:37:53,203 INFO L471 AbstractCegarLoop]: Abstraction has has 926 places, 931 transitions, 1875 flow [2025-02-08 05:37:53,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,204 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] [2025-02-08 05:37:53,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:53,204 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1210430065, now seen corresponding path program 1 times [2025-02-08 05:37:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001792332] [2025-02-08 05:37:53,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:37:53,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:37:53,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,255 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,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001792332] [2025-02-08 05:37:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001792332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728495071] [2025-02-08 05:37:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 993 out of 1033 [2025-02-08 05:37:53,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 926 places, 931 transitions, 1875 flow. Second operand has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 993 of 1033 [2025-02-08 05:37:53,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,562 INFO L124 PetriNetUnfolderBase]: 26/1368 cut-off events. [2025-02-08 05:37:53,562 INFO L125 PetriNetUnfolderBase]: For 4/28 co-relation queries the response was YES. [2025-02-08 05:37:53,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 1368 events. 26/1368 cut-off events. For 4/28 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4711 event pairs, 6 based on Foata normal form. 0/1193 useless extension candidates. Maximal degree in co-relation 1365. Up to 25 conditions per place. [2025-02-08 05:37:53,579 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 12 selfloop transitions, 2 changer transitions 0/930 dead transitions. [2025-02-08 05:37:53,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 930 transitions, 1901 flow [2025-02-08 05:37:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2994 transitions. [2025-02-08 05:37:53,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661181026137464 [2025-02-08 05:37:53,583 INFO L175 Difference]: Start difference. First operand has 926 places, 931 transitions, 1875 flow. Second operand 3 states and 2994 transitions. [2025-02-08 05:37:53,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 930 transitions, 1901 flow [2025-02-08 05:37:53,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 930 transitions, 1897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,591 INFO L231 Difference]: Finished difference. Result has 925 places, 930 transitions, 1873 flow [2025-02-08 05:37:53,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1873, PETRI_PLACES=925, PETRI_TRANSITIONS=930} [2025-02-08 05:37:53,592 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -56 predicate places. [2025-02-08 05:37:53,592 INFO L471 AbstractCegarLoop]: Abstraction has has 925 places, 930 transitions, 1873 flow [2025-02-08 05:37:53,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:53,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:53,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:53,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1863918122, now seen corresponding path program 1 times [2025-02-08 05:37:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663532069] [2025-02-08 05:37:53,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 05:37:53,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 05:37:53,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,655 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,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663532069] [2025-02-08 05:37:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663532069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639702559] [2025-02-08 05:37:53,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 993 out of 1033 [2025-02-08 05:37:53,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 930 transitions, 1873 flow. Second operand has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 993 of 1033 [2025-02-08 05:37:53,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,865 INFO L124 PetriNetUnfolderBase]: 16/959 cut-off events. [2025-02-08 05:37:53,865 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:53,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 959 events. 16/959 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2016 event pairs, 2 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 945. Up to 17 conditions per place. [2025-02-08 05:37:53,877 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 12 selfloop transitions, 2 changer transitions 0/929 dead transitions. [2025-02-08 05:37:53,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 929 transitions, 1899 flow [2025-02-08 05:37:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2994 transitions. [2025-02-08 05:37:53,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661181026137464 [2025-02-08 05:37:53,881 INFO L175 Difference]: Start difference. First operand has 925 places, 930 transitions, 1873 flow. Second operand 3 states and 2994 transitions. [2025-02-08 05:37:53,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 929 transitions, 1899 flow [2025-02-08 05:37:53,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 929 transitions, 1895 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,892 INFO L231 Difference]: Finished difference. Result has 924 places, 929 transitions, 1871 flow [2025-02-08 05:37:53,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1871, PETRI_PLACES=924, PETRI_TRANSITIONS=929} [2025-02-08 05:37:53,894 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -57 predicate places. [2025-02-08 05:37:53,894 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 929 transitions, 1871 flow [2025-02-08 05:37:53,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,895 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] [2025-02-08 05:37:53,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:53,896 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:53,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash 594048897, now seen corresponding path program 1 times [2025-02-08 05:37:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171403634] [2025-02-08 05:37:53,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 05:37:53,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 05:37:53,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,943 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,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171403634] [2025-02-08 05:37:53,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171403634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816045584] [2025-02-08 05:37:53,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 993 out of 1033 [2025-02-08 05:37:53,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 929 transitions, 1871 flow. Second operand has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 993 of 1033 [2025-02-08 05:37:53,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,093 INFO L124 PetriNetUnfolderBase]: 24/1184 cut-off events. [2025-02-08 05:37:54,093 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-02-08 05:37:54,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 1184 events. 24/1184 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3012 event pairs, 6 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1178. Up to 25 conditions per place. [2025-02-08 05:37:54,106 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 12 selfloop transitions, 2 changer transitions 0/928 dead transitions. [2025-02-08 05:37:54,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 928 transitions, 1897 flow [2025-02-08 05:37:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2994 transitions. [2025-02-08 05:37:54,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661181026137464 [2025-02-08 05:37:54,111 INFO L175 Difference]: Start difference. First operand has 924 places, 929 transitions, 1871 flow. Second operand 3 states and 2994 transitions. [2025-02-08 05:37:54,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 928 transitions, 1897 flow [2025-02-08 05:37:54,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 928 transitions, 1893 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,121 INFO L231 Difference]: Finished difference. Result has 923 places, 928 transitions, 1869 flow [2025-02-08 05:37:54,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1869, PETRI_PLACES=923, PETRI_TRANSITIONS=928} [2025-02-08 05:37:54,123 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -58 predicate places. [2025-02-08 05:37:54,123 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 928 transitions, 1869 flow [2025-02-08 05:37:54,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,124 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] [2025-02-08 05:37:54,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:54,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:54,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 974322674, now seen corresponding path program 1 times [2025-02-08 05:37:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535159584] [2025-02-08 05:37:54,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:37:54,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:37:54,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,165 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,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535159584] [2025-02-08 05:37:54,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535159584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543595176] [2025-02-08 05:37:54,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 993 out of 1033 [2025-02-08 05:37:54,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 928 transitions, 1869 flow. Second operand has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 993 of 1033 [2025-02-08 05:37:54,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,306 INFO L124 PetriNetUnfolderBase]: 24/1145 cut-off events. [2025-02-08 05:37:54,306 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-02-08 05:37:54,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 1145 events. 24/1145 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2869 event pairs, 6 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1139. Up to 25 conditions per place. [2025-02-08 05:37:54,317 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 12 selfloop transitions, 2 changer transitions 0/927 dead transitions. [2025-02-08 05:37:54,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 927 transitions, 1895 flow [2025-02-08 05:37:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2994 transitions. [2025-02-08 05:37:54,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661181026137464 [2025-02-08 05:37:54,320 INFO L175 Difference]: Start difference. First operand has 923 places, 928 transitions, 1869 flow. Second operand 3 states and 2994 transitions. [2025-02-08 05:37:54,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 927 transitions, 1895 flow [2025-02-08 05:37:54,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 927 transitions, 1891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,329 INFO L231 Difference]: Finished difference. Result has 922 places, 927 transitions, 1867 flow [2025-02-08 05:37:54,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=922, PETRI_TRANSITIONS=927} [2025-02-08 05:37:54,330 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -59 predicate places. [2025-02-08 05:37:54,330 INFO L471 AbstractCegarLoop]: Abstraction has has 922 places, 927 transitions, 1867 flow [2025-02-08 05:37:54,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 994.3333333333334) internal successors, (2983), 3 states have internal predecessors, (2983), 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,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,331 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] [2025-02-08 05:37:54,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:54,331 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:54,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2120166931, now seen corresponding path program 1 times [2025-02-08 05:37:54,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827150996] [2025-02-08 05:37:54,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 05:37:54,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 05:37:54,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,378 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,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827150996] [2025-02-08 05:37:54,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827150996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228362657] [2025-02-08 05:37:54,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 992 out of 1033 [2025-02-08 05:37:54,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 922 places, 927 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 993.3333333333334) internal successors, (2980), 3 states have internal predecessors, (2980), 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,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 992 of 1033 [2025-02-08 05:37:54,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,717 INFO L124 PetriNetUnfolderBase]: 50/2058 cut-off events. [2025-02-08 05:37:54,721 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:54,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 2058 events. 50/2058 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 10433 event pairs, 20 based on Foata normal form. 0/1763 useless extension candidates. Maximal degree in co-relation 2087. Up to 50 conditions per place. [2025-02-08 05:37:54,758 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 13 selfloop transitions, 2 changer transitions 0/926 dead transitions. [2025-02-08 05:37:54,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 926 transitions, 1895 flow [2025-02-08 05:37:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2992 transitions. [2025-02-08 05:37:54,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654727331397225 [2025-02-08 05:37:54,765 INFO L175 Difference]: Start difference. First operand has 922 places, 927 transitions, 1867 flow. Second operand 3 states and 2992 transitions. [2025-02-08 05:37:54,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 926 transitions, 1895 flow [2025-02-08 05:37:54,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 926 transitions, 1891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,780 INFO L231 Difference]: Finished difference. Result has 921 places, 926 transitions, 1865 flow [2025-02-08 05:37:54,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1865, PETRI_PLACES=921, PETRI_TRANSITIONS=926} [2025-02-08 05:37:54,785 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -60 predicate places. [2025-02-08 05:37:54,786 INFO L471 AbstractCegarLoop]: Abstraction has has 921 places, 926 transitions, 1865 flow [2025-02-08 05:37:54,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 993.3333333333334) internal successors, (2980), 3 states have internal predecessors, (2980), 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,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,787 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] [2025-02-08 05:37:54,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:54,787 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:37:54,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1176838161, now seen corresponding path program 1 times [2025-02-08 05:37:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850552676] [2025-02-08 05:37:54,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 05:37:54,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 05:37:54,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,327 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,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850552676] [2025-02-08 05:37:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850552676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518849819] [2025-02-08 05:37:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:55,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:55,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:55,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 904 out of 1033 [2025-02-08 05:37:55,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 926 transitions, 1865 flow. Second operand has 6 states, 6 states have (on average 905.5) internal successors, (5433), 6 states have internal predecessors, (5433), 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,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 904 of 1033 [2025-02-08 05:37:55,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,540 INFO L124 PetriNetUnfolderBase]: 14628/69460 cut-off events. [2025-02-08 05:38:06,541 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-02-08 05:38:06,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91551 conditions, 69460 events. 14628/69460 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 984662 event pairs, 14040 based on Foata normal form. 0/59584 useless extension candidates. Maximal degree in co-relation 91509. Up to 21688 conditions per place. [2025-02-08 05:38:06,932 INFO L140 encePairwiseOnDemand]: 1015/1033 looper letters, 87 selfloop transitions, 15 changer transitions 0/923 dead transitions. [2025-02-08 05:38:06,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 923 transitions, 2063 flow [2025-02-08 05:38:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5529 transitions. [2025-02-08 05:38:06,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8920619554695063 [2025-02-08 05:38:06,938 INFO L175 Difference]: Start difference. First operand has 921 places, 926 transitions, 1865 flow. Second operand 6 states and 5529 transitions. [2025-02-08 05:38:06,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 923 transitions, 2063 flow [2025-02-08 05:38:06,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 923 transitions, 2059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:06,946 INFO L231 Difference]: Finished difference. Result has 921 places, 923 transitions, 1885 flow [2025-02-08 05:38:06,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1885, PETRI_PLACES=921, PETRI_TRANSITIONS=923} [2025-02-08 05:38:06,947 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -60 predicate places. [2025-02-08 05:38:06,947 INFO L471 AbstractCegarLoop]: Abstraction has has 921 places, 923 transitions, 1885 flow [2025-02-08 05:38:06,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 905.5) internal successors, (5433), 6 states have internal predecessors, (5433), 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,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,948 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] [2025-02-08 05:38:06,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:06,948 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:06,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2141433314, now seen corresponding path program 1 times [2025-02-08 05:38:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273613300] [2025-02-08 05:38:06,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-08 05:38:06,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-08 05:38:06,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,001 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,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273613300] [2025-02-08 05:38:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273613300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:07,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522862149] [2025-02-08 05:38:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 992 out of 1033 [2025-02-08 05:38:07,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 923 transitions, 1885 flow. Second operand has 3 states, 3 states have (on average 993.3333333333334) internal successors, (2980), 3 states have internal predecessors, (2980), 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,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 992 of 1033 [2025-02-08 05:38:07,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:07,237 INFO L124 PetriNetUnfolderBase]: 38/1790 cut-off events. [2025-02-08 05:38:07,237 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-02-08 05:38:07,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 1790 events. 38/1790 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7259 event pairs, 12 based on Foata normal form. 0/1547 useless extension candidates. Maximal degree in co-relation 1814. Up to 38 conditions per place. [2025-02-08 05:38:07,259 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 13 selfloop transitions, 2 changer transitions 0/922 dead transitions. [2025-02-08 05:38:07,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 922 transitions, 1913 flow [2025-02-08 05:38:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2992 transitions. [2025-02-08 05:38:07,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654727331397225 [2025-02-08 05:38:07,263 INFO L175 Difference]: Start difference. First operand has 921 places, 923 transitions, 1885 flow. Second operand 3 states and 2992 transitions. [2025-02-08 05:38:07,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 922 transitions, 1913 flow [2025-02-08 05:38:07,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 922 transitions, 1883 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:07,271 INFO L231 Difference]: Finished difference. Result has 917 places, 922 transitions, 1857 flow [2025-02-08 05:38:07,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=915, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1857, PETRI_PLACES=917, PETRI_TRANSITIONS=922} [2025-02-08 05:38:07,272 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -64 predicate places. [2025-02-08 05:38:07,272 INFO L471 AbstractCegarLoop]: Abstraction has has 917 places, 922 transitions, 1857 flow [2025-02-08 05:38:07,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 993.3333333333334) internal successors, (2980), 3 states have internal predecessors, (2980), 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,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:07,273 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] [2025-02-08 05:38:07,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:07,273 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:07,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:07,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1283256203, now seen corresponding path program 1 times [2025-02-08 05:38:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893492663] [2025-02-08 05:38:07,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:07,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 05:38:07,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 05:38:07,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:07,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,340 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,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893492663] [2025-02-08 05:38:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893492663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188046471] [2025-02-08 05:38:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 992 out of 1033 [2025-02-08 05:38:07,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 922 transitions, 1857 flow. Second operand has 3 states, 3 states have (on average 993.3333333333334) internal successors, (2980), 3 states have internal predecessors, (2980), 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,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 992 of 1033 [2025-02-08 05:38:07,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:07,555 INFO L124 PetriNetUnfolderBase]: 44/1591 cut-off events. [2025-02-08 05:38:07,556 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-02-08 05:38:07,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 1591 events. 44/1591 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5961 event pairs, 20 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 1612. Up to 50 conditions per place. [2025-02-08 05:38:07,579 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 13 selfloop transitions, 2 changer transitions 0/921 dead transitions. [2025-02-08 05:38:07,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 918 places, 921 transitions, 1885 flow [2025-02-08 05:38:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2992 transitions. [2025-02-08 05:38:07,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654727331397225 [2025-02-08 05:38:07,583 INFO L175 Difference]: Start difference. First operand has 917 places, 922 transitions, 1857 flow. Second operand 3 states and 2992 transitions. [2025-02-08 05:38:07,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 918 places, 921 transitions, 1885 flow [2025-02-08 05:38:07,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 916 places, 921 transitions, 1881 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:07,591 INFO L231 Difference]: Finished difference. Result has 916 places, 921 transitions, 1855 flow [2025-02-08 05:38:07,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1851, PETRI_DIFFERENCE_MINUEND_PLACES=914, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1855, PETRI_PLACES=916, PETRI_TRANSITIONS=921} [2025-02-08 05:38:07,593 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -65 predicate places. [2025-02-08 05:38:07,593 INFO L471 AbstractCegarLoop]: Abstraction has has 916 places, 921 transitions, 1855 flow [2025-02-08 05:38:07,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 993.3333333333334) internal successors, (2980), 3 states have internal predecessors, (2980), 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,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:07,594 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] [2025-02-08 05:38:07,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:38:07,594 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:07,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:07,595 INFO L85 PathProgramCache]: Analyzing trace with hash 851945699, now seen corresponding path program 1 times [2025-02-08 05:38:07,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:07,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164338788] [2025-02-08 05:38:07,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:07,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:07,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-08 05:38:07,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-08 05:38:07,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:07,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,748 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,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164338788] [2025-02-08 05:38:07,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164338788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592989122] [2025-02-08 05:38:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 904 out of 1033 [2025-02-08 05:38:07,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 916 places, 921 transitions, 1855 flow. Second operand has 3 states, 3 states have (on average 906.0) internal successors, (2718), 3 states have internal predecessors, (2718), 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,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 904 of 1033 [2025-02-08 05:38:07,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:18,735 INFO L124 PetriNetUnfolderBase]: 14628/69455 cut-off events. [2025-02-08 05:38:18,735 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-02-08 05:38:18,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91546 conditions, 69455 events. 14628/69455 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 985265 event pairs, 14040 based on Foata normal form. 0/59584 useless extension candidates. Maximal degree in co-relation 91504. Up to 21697 conditions per place. [2025-02-08 05:38:19,114 INFO L140 encePairwiseOnDemand]: 1024/1033 looper letters, 96 selfloop transitions, 6 changer transitions 0/918 dead transitions. [2025-02-08 05:38:19,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 915 places, 918 transitions, 2053 flow [2025-02-08 05:38:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2817 transitions. [2025-02-08 05:38:19,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090029041626331 [2025-02-08 05:38:19,118 INFO L175 Difference]: Start difference. First operand has 916 places, 921 transitions, 1855 flow. Second operand 3 states and 2817 transitions. [2025-02-08 05:38:19,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 915 places, 918 transitions, 2053 flow [2025-02-08 05:38:19,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 918 transitions, 2049 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:19,125 INFO L231 Difference]: Finished difference. Result has 913 places, 918 transitions, 1857 flow [2025-02-08 05:38:19,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1857, PETRI_PLACES=913, PETRI_TRANSITIONS=918} [2025-02-08 05:38:19,126 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -68 predicate places. [2025-02-08 05:38:19,126 INFO L471 AbstractCegarLoop]: Abstraction has has 913 places, 918 transitions, 1857 flow [2025-02-08 05:38:19,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 906.0) internal successors, (2718), 3 states have internal predecessors, (2718), 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:19,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:19,126 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:19,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:38:19,127 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:19,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash 314146325, now seen corresponding path program 1 times [2025-02-08 05:38:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:19,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161611174] [2025-02-08 05:38:19,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:19,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-08 05:38:19,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-08 05:38:19,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:19,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:19,230 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:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161611174] [2025-02-08 05:38:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161611174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720082100] [2025-02-08 05:38:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:19,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:19,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:19,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:19,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 994 out of 1033 [2025-02-08 05:38:19,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 913 places, 918 transitions, 1857 flow. Second operand has 3 states, 3 states have (on average 995.3333333333334) internal successors, (2986), 3 states have internal predecessors, (2986), 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:19,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:19,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 994 of 1033 [2025-02-08 05:38:19,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:19,409 INFO L124 PetriNetUnfolderBase]: 29/1500 cut-off events. [2025-02-08 05:38:19,410 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:19,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1500 events. 29/1500 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5589 event pairs, 7 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 1515. Up to 25 conditions per place. [2025-02-08 05:38:19,425 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 11 selfloop transitions, 2 changer transitions 0/917 dead transitions. [2025-02-08 05:38:19,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 914 places, 917 transitions, 1881 flow [2025-02-08 05:38:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2996 transitions. [2025-02-08 05:38:19,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667634720877702 [2025-02-08 05:38:19,427 INFO L175 Difference]: Start difference. First operand has 913 places, 918 transitions, 1857 flow. Second operand 3 states and 2996 transitions. [2025-02-08 05:38:19,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 914 places, 917 transitions, 1881 flow [2025-02-08 05:38:19,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 912 places, 917 transitions, 1869 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:19,435 INFO L231 Difference]: Finished difference. Result has 912 places, 917 transitions, 1847 flow [2025-02-08 05:38:19,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1847, PETRI_PLACES=912, PETRI_TRANSITIONS=917} [2025-02-08 05:38:19,436 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -69 predicate places. [2025-02-08 05:38:19,436 INFO L471 AbstractCegarLoop]: Abstraction has has 912 places, 917 transitions, 1847 flow [2025-02-08 05:38:19,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 995.3333333333334) internal successors, (2986), 3 states have internal predecessors, (2986), 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:19,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:19,436 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] [2025-02-08 05:38:19,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:38:19,437 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1241992548, now seen corresponding path program 1 times [2025-02-08 05:38:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718697233] [2025-02-08 05:38:19,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:19,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-08 05:38:19,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-08 05:38:19,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:19,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:19,491 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:19,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718697233] [2025-02-08 05:38:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718697233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:19,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842063925] [2025-02-08 05:38:19,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:19,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:19,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:19,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:19,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 994 out of 1033 [2025-02-08 05:38:19,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 917 transitions, 1847 flow. Second operand has 3 states, 3 states have (on average 995.3333333333334) internal successors, (2986), 3 states have internal predecessors, (2986), 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:19,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:19,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 994 of 1033 [2025-02-08 05:38:19,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:19,808 INFO L124 PetriNetUnfolderBase]: 27/1412 cut-off events. [2025-02-08 05:38:19,809 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:19,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 1412 events. 27/1412 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4398 event pairs, 5 based on Foata normal form. 0/1240 useless extension candidates. Maximal degree in co-relation 1405. Up to 22 conditions per place. [2025-02-08 05:38:19,825 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 11 selfloop transitions, 2 changer transitions 0/916 dead transitions. [2025-02-08 05:38:19,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 916 transitions, 1871 flow [2025-02-08 05:38:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2996 transitions. [2025-02-08 05:38:19,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667634720877702 [2025-02-08 05:38:19,833 INFO L175 Difference]: Start difference. First operand has 912 places, 917 transitions, 1847 flow. Second operand 3 states and 2996 transitions. [2025-02-08 05:38:19,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 916 transitions, 1871 flow [2025-02-08 05:38:19,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 911 places, 916 transitions, 1867 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:19,849 INFO L231 Difference]: Finished difference. Result has 911 places, 916 transitions, 1845 flow [2025-02-08 05:38:19,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1841, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1845, PETRI_PLACES=911, PETRI_TRANSITIONS=916} [2025-02-08 05:38:19,850 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -70 predicate places. [2025-02-08 05:38:19,850 INFO L471 AbstractCegarLoop]: Abstraction has has 911 places, 916 transitions, 1845 flow [2025-02-08 05:38:19,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 995.3333333333334) internal successors, (2986), 3 states have internal predecessors, (2986), 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:19,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:19,851 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] [2025-02-08 05:38:19,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:38:19,851 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:19,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1484285695, now seen corresponding path program 1 times [2025-02-08 05:38:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:19,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366690034] [2025-02-08 05:38:19,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:19,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-08 05:38:19,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-08 05:38:19,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:19,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:19,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366690034] [2025-02-08 05:38:19,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366690034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:19,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:19,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:19,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641424974] [2025-02-08 05:38:19,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:19,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:19,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:19,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:19,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 994 out of 1033 [2025-02-08 05:38:19,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 916 transitions, 1845 flow. Second operand has 3 states, 3 states have (on average 995.3333333333334) internal successors, (2986), 3 states have internal predecessors, (2986), 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:19,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:19,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 994 of 1033 [2025-02-08 05:38:19,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:20,169 INFO L124 PetriNetUnfolderBase]: 26/1246 cut-off events. [2025-02-08 05:38:20,169 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-08 05:38:20,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 1246 events. 26/1246 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3534 event pairs, 7 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1242. Up to 26 conditions per place. [2025-02-08 05:38:20,182 INFO L140 encePairwiseOnDemand]: 1030/1033 looper letters, 11 selfloop transitions, 2 changer transitions 0/915 dead transitions. [2025-02-08 05:38:20,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 915 transitions, 1869 flow [2025-02-08 05:38:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2996 transitions. [2025-02-08 05:38:20,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667634720877702 [2025-02-08 05:38:20,185 INFO L175 Difference]: Start difference. First operand has 911 places, 916 transitions, 1845 flow. Second operand 3 states and 2996 transitions. [2025-02-08 05:38:20,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 912 places, 915 transitions, 1869 flow [2025-02-08 05:38:20,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 910 places, 915 transitions, 1865 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:20,194 INFO L231 Difference]: Finished difference. Result has 910 places, 915 transitions, 1843 flow [2025-02-08 05:38:20,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1839, PETRI_DIFFERENCE_MINUEND_PLACES=908, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1843, PETRI_PLACES=910, PETRI_TRANSITIONS=915} [2025-02-08 05:38:20,195 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -71 predicate places. [2025-02-08 05:38:20,195 INFO L471 AbstractCegarLoop]: Abstraction has has 910 places, 915 transitions, 1843 flow [2025-02-08 05:38:20,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 995.3333333333334) internal successors, (2986), 3 states have internal predecessors, (2986), 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:20,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:20,195 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] [2025-02-08 05:38:20,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:38:20,196 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:20,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash -428596243, now seen corresponding path program 1 times [2025-02-08 05:38:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:20,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923342127] [2025-02-08 05:38:20,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:20,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-08 05:38:20,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-08 05:38:20,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:20,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:20,267 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:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923342127] [2025-02-08 05:38:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923342127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519670085] [2025-02-08 05:38:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:20,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:20,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:20,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 990 out of 1033 [2025-02-08 05:38:20,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 910 places, 915 transitions, 1843 flow. Second operand has 3 states, 3 states have (on average 991.3333333333334) internal successors, (2974), 3 states have internal predecessors, (2974), 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:20,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:20,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 990 of 1033 [2025-02-08 05:38:20,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:20,761 INFO L124 PetriNetUnfolderBase]: 98/2681 cut-off events. [2025-02-08 05:38:20,761 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:20,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 2681 events. 98/2681 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 16853 event pairs, 28 based on Foata normal form. 0/2324 useless extension candidates. Maximal degree in co-relation 2805. Up to 123 conditions per place. [2025-02-08 05:38:20,798 INFO L140 encePairwiseOnDemand]: 1027/1033 looper letters, 17 selfloop transitions, 2 changer transitions 0/915 dead transitions. [2025-02-08 05:38:20,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 908 places, 915 transitions, 1883 flow [2025-02-08 05:38:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2993 transitions. [2025-02-08 05:38:20,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657954178767344 [2025-02-08 05:38:20,801 INFO L175 Difference]: Start difference. First operand has 910 places, 915 transitions, 1843 flow. Second operand 3 states and 2993 transitions. [2025-02-08 05:38:20,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 908 places, 915 transitions, 1883 flow [2025-02-08 05:38:20,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 906 places, 915 transitions, 1879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:20,823 INFO L231 Difference]: Finished difference. Result has 907 places, 913 transitions, 1845 flow [2025-02-08 05:38:20,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1845, PETRI_PLACES=907, PETRI_TRANSITIONS=913} [2025-02-08 05:38:20,824 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -74 predicate places. [2025-02-08 05:38:20,824 INFO L471 AbstractCegarLoop]: Abstraction has has 907 places, 913 transitions, 1845 flow [2025-02-08 05:38:20,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 991.3333333333334) internal successors, (2974), 3 states have internal predecessors, (2974), 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:20,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:20,825 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] [2025-02-08 05:38:20,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:38:20,825 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:20,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash -605378223, now seen corresponding path program 1 times [2025-02-08 05:38:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:20,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714251389] [2025-02-08 05:38:20,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:20,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:20,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-08 05:38:20,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-08 05:38:20,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:20,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:21,066 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:21,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:21,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714251389] [2025-02-08 05:38:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714251389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:21,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:38:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940611260] [2025-02-08 05:38:21,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:21,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:38:21,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:21,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:38:21,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:38:21,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 967 out of 1033 [2025-02-08 05:38:21,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 913 transitions, 1845 flow. Second operand has 7 states, 7 states have (on average 971.4285714285714) internal successors, (6800), 7 states have internal predecessors, (6800), 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:21,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:21,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 967 of 1033 [2025-02-08 05:38:21,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:21,884 INFO L124 PetriNetUnfolderBase]: 32/1955 cut-off events. [2025-02-08 05:38:21,885 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:38:21,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 1955 events. 32/1955 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8644 event pairs, 0 based on Foata normal form. 1/1759 useless extension candidates. Maximal degree in co-relation 2010. Up to 39 conditions per place. [2025-02-08 05:38:21,912 INFO L140 encePairwiseOnDemand]: 1023/1033 looper letters, 67 selfloop transitions, 9 changer transitions 0/948 dead transitions. [2025-02-08 05:38:21,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 948 transitions, 2073 flow [2025-02-08 05:38:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:38:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 05:38:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6846 transitions. [2025-02-08 05:38:21,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467570183930301 [2025-02-08 05:38:21,917 INFO L175 Difference]: Start difference. First operand has 907 places, 913 transitions, 1845 flow. Second operand 7 states and 6846 transitions. [2025-02-08 05:38:21,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 948 transitions, 2073 flow [2025-02-08 05:38:21,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 948 transitions, 2073 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:21,928 INFO L231 Difference]: Finished difference. Result has 917 places, 919 transitions, 1902 flow [2025-02-08 05:38:21,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=907, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1902, PETRI_PLACES=917, PETRI_TRANSITIONS=919} [2025-02-08 05:38:21,929 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -64 predicate places. [2025-02-08 05:38:21,929 INFO L471 AbstractCegarLoop]: Abstraction has has 917 places, 919 transitions, 1902 flow [2025-02-08 05:38:21,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 971.4285714285714) internal successors, (6800), 7 states have internal predecessors, (6800), 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:21,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:21,930 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] [2025-02-08 05:38:21,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:38:21,930 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:21,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash -204252952, now seen corresponding path program 1 times [2025-02-08 05:38:21,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181182002] [2025-02-08 05:38:21,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:21,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:21,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-08 05:38:21,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-08 05:38:21,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:21,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:22,243 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:22,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:22,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181182002] [2025-02-08 05:38:22,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181182002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:22,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:22,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:38:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459238961] [2025-02-08 05:38:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:22,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:38:22,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:22,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:38:22,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:38:22,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 962 out of 1033 [2025-02-08 05:38:22,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 919 transitions, 1902 flow. Second operand has 8 states, 8 states have (on average 966.375) internal successors, (7731), 8 states have internal predecessors, (7731), 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:22,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:22,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 962 of 1033 [2025-02-08 05:38:22,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:23,226 INFO L124 PetriNetUnfolderBase]: 46/2855 cut-off events. [2025-02-08 05:38:23,226 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2025-02-08 05:38:23,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 2855 events. 46/2855 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16135 event pairs, 0 based on Foata normal form. 1/2563 useless extension candidates. Maximal degree in co-relation 2997. Up to 80 conditions per place. [2025-02-08 05:38:23,267 INFO L140 encePairwiseOnDemand]: 1020/1033 looper letters, 80 selfloop transitions, 13 changer transitions 0/960 dead transitions. [2025-02-08 05:38:23,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 960 transitions, 2190 flow [2025-02-08 05:38:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:38:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:38:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8746 transitions. [2025-02-08 05:38:23,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9407335699688072 [2025-02-08 05:38:23,271 INFO L175 Difference]: Start difference. First operand has 917 places, 919 transitions, 1902 flow. Second operand 9 states and 8746 transitions. [2025-02-08 05:38:23,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 960 transitions, 2190 flow [2025-02-08 05:38:23,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 960 transitions, 2185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:23,280 INFO L231 Difference]: Finished difference. Result has 930 places, 930 transitions, 1991 flow [2025-02-08 05:38:23,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=915, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1991, PETRI_PLACES=930, PETRI_TRANSITIONS=930} [2025-02-08 05:38:23,281 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -51 predicate places. [2025-02-08 05:38:23,281 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 930 transitions, 1991 flow [2025-02-08 05:38:23,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 966.375) internal successors, (7731), 8 states have internal predecessors, (7731), 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:23,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:23,282 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] [2025-02-08 05:38:23,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:38:23,282 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:23,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:23,283 INFO L85 PathProgramCache]: Analyzing trace with hash -792551121, now seen corresponding path program 1 times [2025-02-08 05:38:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:23,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123427437] [2025-02-08 05:38:23,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:23,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:23,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-08 05:38:23,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-08 05:38:23,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:23,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:23,835 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:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123427437] [2025-02-08 05:38:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123427437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992143913] [2025-02-08 05:38:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:23,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:23,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:24,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 960 out of 1033 [2025-02-08 05:38:24,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 930 transitions, 1991 flow. Second operand has 6 states, 6 states have (on average 961.6666666666666) internal successors, (5770), 6 states have internal predecessors, (5770), 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:24,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:24,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 960 of 1033 [2025-02-08 05:38:24,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:27,078 INFO L124 PetriNetUnfolderBase]: 1234/14261 cut-off events. [2025-02-08 05:38:27,078 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-08 05:38:27,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16767 conditions, 14261 events. 1234/14261 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 163276 event pairs, 273 based on Foata normal form. 0/12374 useless extension candidates. Maximal degree in co-relation 16711. Up to 1665 conditions per place. [2025-02-08 05:38:27,312 INFO L140 encePairwiseOnDemand]: 1021/1033 looper letters, 65 selfloop transitions, 8 changer transitions 0/954 dead transitions. [2025-02-08 05:38:27,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 954 transitions, 2193 flow [2025-02-08 05:38:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5837 transitions. [2025-02-08 05:38:27,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.941755404969345 [2025-02-08 05:38:27,317 INFO L175 Difference]: Start difference. First operand has 930 places, 930 transitions, 1991 flow. Second operand 6 states and 5837 transitions. [2025-02-08 05:38:27,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 954 transitions, 2193 flow [2025-02-08 05:38:27,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 954 transitions, 2193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:27,326 INFO L231 Difference]: Finished difference. Result has 935 places, 934 transitions, 2045 flow [2025-02-08 05:38:27,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=935, PETRI_TRANSITIONS=934} [2025-02-08 05:38:27,327 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -46 predicate places. [2025-02-08 05:38:27,327 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 934 transitions, 2045 flow [2025-02-08 05:38:27,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 961.6666666666666) internal successors, (5770), 6 states have internal predecessors, (5770), 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:27,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:27,329 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] [2025-02-08 05:38:27,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:38:27,329 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:27,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1859893959, now seen corresponding path program 1 times [2025-02-08 05:38:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791963877] [2025-02-08 05:38:27,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:27,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-08 05:38:27,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-08 05:38:27,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:27,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:27,401 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:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791963877] [2025-02-08 05:38:27,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791963877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:27,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:27,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:27,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206812066] [2025-02-08 05:38:27,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:27,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:27,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:27,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:27,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:27,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 990 out of 1033 [2025-02-08 05:38:27,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 934 transitions, 2045 flow. Second operand has 3 states, 3 states have (on average 992.0) internal successors, (2976), 3 states have internal predecessors, (2976), 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:27,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:27,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 990 of 1033 [2025-02-08 05:38:27,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:28,912 INFO L124 PetriNetUnfolderBase]: 214/7142 cut-off events. [2025-02-08 05:38:28,912 INFO L125 PetriNetUnfolderBase]: For 51/138 co-relation queries the response was YES. [2025-02-08 05:38:29,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7658 conditions, 7142 events. 214/7142 cut-off events. For 51/138 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 67328 event pairs, 54 based on Foata normal form. 3/6236 useless extension candidates. Maximal degree in co-relation 7601. Up to 225 conditions per place. [2025-02-08 05:38:29,066 INFO L140 encePairwiseOnDemand]: 1027/1033 looper letters, 17 selfloop transitions, 2 changer transitions 0/934 dead transitions. [2025-02-08 05:38:29,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 934 transitions, 2085 flow [2025-02-08 05:38:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2993 transitions. [2025-02-08 05:38:29,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657954178767344 [2025-02-08 05:38:29,069 INFO L175 Difference]: Start difference. First operand has 935 places, 934 transitions, 2045 flow. Second operand 3 states and 2993 transitions. [2025-02-08 05:38:29,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 934 transitions, 2085 flow [2025-02-08 05:38:29,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 934 transitions, 2085 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:29,079 INFO L231 Difference]: Finished difference. Result has 934 places, 932 transitions, 2051 flow [2025-02-08 05:38:29,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1033, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2051, PETRI_PLACES=934, PETRI_TRANSITIONS=932} [2025-02-08 05:38:29,081 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -47 predicate places. [2025-02-08 05:38:29,081 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 932 transitions, 2051 flow [2025-02-08 05:38:29,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 992.0) internal successors, (2976), 3 states have internal predecessors, (2976), 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:29,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:29,082 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] [2025-02-08 05:38:29,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:38:29,082 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-02-08 05:38:29,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2098656975, now seen corresponding path program 1 times [2025-02-08 05:38:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:29,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855816066] [2025-02-08 05:38:29,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:29,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:29,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-08 05:38:29,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-08 05:38:29,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:29,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:29,158 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:29,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855816066] [2025-02-08 05:38:29,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855816066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:29,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:29,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:29,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389541235] [2025-02-08 05:38:29,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:29,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:29,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:29,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:29,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:29,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1033 [2025-02-08 05:38:29,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 932 transitions, 2051 flow. Second operand has 3 states, 3 states have (on average 996.6666666666666) internal successors, (2990), 3 states have internal predecessors, (2990), 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:29,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:29,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1033 [2025-02-08 05:38:29,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand