./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/twostage_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/twostage_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:35:59,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:35:59,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:35:59,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:35:59,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:35:59,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:35:59,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:35:59,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:35:59,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:35:59,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:35:59,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:35:59,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:35:59,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:35:59,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:35:59,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:35:59,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:35:59,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:35:59,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:35:59,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:35:59,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:35:59,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:35:59,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:35:59,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:35:59,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:35:59,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:35:59,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:35:59,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:35:59,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:35:59,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:35:59,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:35:59,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:35:59,116 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 [2025-03-08 21:35:59,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:35:59,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:35:59,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:35:59,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:35:59,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:35:59,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/twostage_3.i [2025-03-08 21:36:00,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a207dc96/6f836b1e6bfe450e8882c90b2d90e48b/FLAGba5e55d09 [2025-03-08 21:36:00,883 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:36:00,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-03-08 21:36:00,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a207dc96/6f836b1e6bfe450e8882c90b2d90e48b/FLAGba5e55d09 [2025-03-08 21:36:00,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a207dc96/6f836b1e6bfe450e8882c90b2d90e48b [2025-03-08 21:36:00,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:36:00,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:36:00,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:36:00,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:36:00,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:36:00,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:36:00" (1/1) ... [2025-03-08 21:36:00,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f03dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:00, skipping insertion in model container [2025-03-08 21:36:00,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:36:00" (1/1) ... [2025-03-08 21:36:00,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:36:01,349 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-08 21:36:01,349 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-08 21:36:01,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:36:01,361 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:36:01,429 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-08 21:36:01,433 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-08 21:36:01,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:36:01,492 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:36:01,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01 WrapperNode [2025-03-08 21:36:01,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:36:01,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:36:01,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:36:01,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:36:01,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,576 INFO L138 Inliner]: procedures = 373, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 272 [2025-03-08 21:36:01,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:36:01,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:36:01,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:36:01,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:36:01,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:36:01,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:36:01,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:36:01,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:36:01,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (1/1) ... [2025-03-08 21:36:01,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:36:01,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:36:01,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:36:01,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:36:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-03-08 21:36:01,682 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-03-08 21:36:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-03-08 21:36:01,682 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-03-08 21:36:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:36:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:36:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:36:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:36:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:36:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:36:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:36:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:36:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:36:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:36:01,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:36:01,685 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:36:01,811 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:36:01,813 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:36:02,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1301: havoc main_~#tPool~0#1.base, main_~#tPool~0#1.offset; [2025-03-08 21:36:02,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1301-1: SUMMARY for call ULTIMATE.dealloc(main_~#tPool~0#1.base, main_~#tPool~0#1.offset); srcloc: null [2025-03-08 21:36:02,192 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1302: havoc main_~#rPool~0#1.base, main_~#rPool~0#1.offset; [2025-03-08 21:36:02,192 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1302-1: SUMMARY for call ULTIMATE.dealloc(main_~#rPool~0#1.base, main_~#rPool~0#1.offset); srcloc: null [2025-03-08 21:36:02,232 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:36:02,232 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:36:02,263 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:36:02,263 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:36:02,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:02 BoogieIcfgContainer [2025-03-08 21:36:02,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:36:02,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:36:02,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:36:02,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:36:02,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:36:00" (1/3) ... [2025-03-08 21:36:02,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25578b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:36:02, skipping insertion in model container [2025-03-08 21:36:02,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:01" (2/3) ... [2025-03-08 21:36:02,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25578b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:36:02, skipping insertion in model container [2025-03-08 21:36:02,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:02" (3/3) ... [2025-03-08 21:36:02,275 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-03-08 21:36:02,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:36:02,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 347 locations, 1 initial locations, 4 loop locations, and 45 error locations. [2025-03-08 21:36:02,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:36:02,366 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 21:36:02,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 369 transitions, 758 flow [2025-03-08 21:36:02,562 INFO L124 PetriNetUnfolderBase]: 43/682 cut-off events. [2025-03-08 21:36:02,564 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 21:36:02,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 682 events. 43/682 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2985 event pairs, 0 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 354. Up to 8 conditions per place. [2025-03-08 21:36:02,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 369 transitions, 758 flow [2025-03-08 21:36:02,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 353 places, 369 transitions, 758 flow [2025-03-08 21:36:02,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:36:02,607 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;@76a1a04f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:36:02,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-08 21:36:02,612 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:36:02,613 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-08 21:36:02,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:36:02,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:02,614 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] [2025-03-08 21:36:02,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:02,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2006078931, now seen corresponding path program 1 times [2025-03-08 21:36:02,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:02,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970286327] [2025-03-08 21:36:02,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:02,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 21:36:02,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 21:36:02,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:02,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:02,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970286327] [2025-03-08 21:36:02,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970286327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:02,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:02,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:02,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632363545] [2025-03-08 21:36:02,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:02,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:02,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:02,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:02,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 369 [2025-03-08 21:36:02,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 369 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:02,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:02,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 369 [2025-03-08 21:36:02,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:03,231 INFO L124 PetriNetUnfolderBase]: 271/2560 cut-off events. [2025-03-08 21:36:03,231 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-08 21:36:03,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3072 conditions, 2560 events. 271/2560 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 20217 event pairs, 234 based on Foata normal form. 246/2367 useless extension candidates. Maximal degree in co-relation 2414. Up to 458 conditions per place. [2025-03-08 21:36:03,249 INFO L140 encePairwiseOnDemand]: 350/369 looper letters, 25 selfloop transitions, 1 changer transitions 8/349 dead transitions. [2025-03-08 21:36:03,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 349 transitions, 770 flow [2025-03-08 21:36:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-03-08 21:36:03,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9177958446251129 [2025-03-08 21:36:03,268 INFO L175 Difference]: Start difference. First operand has 353 places, 369 transitions, 758 flow. Second operand 3 states and 1016 transitions. [2025-03-08 21:36:03,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 349 transitions, 770 flow [2025-03-08 21:36:03,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 349 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:36:03,277 INFO L231 Difference]: Finished difference. Result has 349 places, 341 transitions, 704 flow [2025-03-08 21:36:03,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=349, PETRI_TRANSITIONS=341} [2025-03-08 21:36:03,282 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -4 predicate places. [2025-03-08 21:36:03,282 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 341 transitions, 704 flow [2025-03-08 21:36:03,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:03,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:03,283 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] [2025-03-08 21:36:03,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:36:03,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:03,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2058874563, now seen corresponding path program 1 times [2025-03-08 21:36:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:03,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139018080] [2025-03-08 21:36:03,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:03,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 21:36:03,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 21:36:03,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:03,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:03,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139018080] [2025-03-08 21:36:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139018080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:03,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295154713] [2025-03-08 21:36:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:03,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:03,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:03,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:03,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 369 [2025-03-08 21:36:03,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 341 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:03,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:03,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 369 [2025-03-08 21:36:03,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:03,735 INFO L124 PetriNetUnfolderBase]: 152/2660 cut-off events. [2025-03-08 21:36:03,735 INFO L125 PetriNetUnfolderBase]: For 210/266 co-relation queries the response was YES. [2025-03-08 21:36:03,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3059 conditions, 2660 events. 152/2660 cut-off events. For 210/266 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 20722 event pairs, 116 based on Foata normal form. 0/2231 useless extension candidates. Maximal degree in co-relation 1499. Up to 147 conditions per place. [2025-03-08 21:36:03,756 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 35 selfloop transitions, 1 changer transitions 0/357 dead transitions. [2025-03-08 21:36:03,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 357 transitions, 826 flow [2025-03-08 21:36:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-03-08 21:36:03,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938572719060524 [2025-03-08 21:36:03,759 INFO L175 Difference]: Start difference. First operand has 349 places, 341 transitions, 704 flow. Second operand 3 states and 1039 transitions. [2025-03-08 21:36:03,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 357 transitions, 826 flow [2025-03-08 21:36:03,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 357 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:03,764 INFO L231 Difference]: Finished difference. Result has 341 places, 340 transitions, 703 flow [2025-03-08 21:36:03,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=341, PETRI_TRANSITIONS=340} [2025-03-08 21:36:03,765 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -12 predicate places. [2025-03-08 21:36:03,765 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 340 transitions, 703 flow [2025-03-08 21:36:03,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:03,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:03,766 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] [2025-03-08 21:36:03,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:36:03,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:03,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash 599213088, now seen corresponding path program 1 times [2025-03-08 21:36:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:03,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732026272] [2025-03-08 21:36:03,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:03,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 21:36:03,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 21:36:03,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:03,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:03,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:03,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732026272] [2025-03-08 21:36:03,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732026272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:03,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:03,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72791237] [2025-03-08 21:36:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:03,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:03,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:03,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:03,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:03,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 369 [2025-03-08 21:36:03,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 340 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:03,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:03,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 369 [2025-03-08 21:36:03,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:04,253 INFO L124 PetriNetUnfolderBase]: 728/3855 cut-off events. [2025-03-08 21:36:04,254 INFO L125 PetriNetUnfolderBase]: For 234/290 co-relation queries the response was YES. [2025-03-08 21:36:04,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 3855 events. 728/3855 cut-off events. For 234/290 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 32467 event pairs, 156 based on Foata normal form. 5/3419 useless extension candidates. Maximal degree in co-relation 2644. Up to 1033 conditions per place. [2025-03-08 21:36:04,282 INFO L140 encePairwiseOnDemand]: 353/369 looper letters, 37 selfloop transitions, 5 changer transitions 11/349 dead transitions. [2025-03-08 21:36:04,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 349 transitions, 821 flow [2025-03-08 21:36:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2025-03-08 21:36:04,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8979223125564589 [2025-03-08 21:36:04,285 INFO L175 Difference]: Start difference. First operand has 341 places, 340 transitions, 703 flow. Second operand 3 states and 994 transitions. [2025-03-08 21:36:04,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 349 transitions, 821 flow [2025-03-08 21:36:04,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 349 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:04,290 INFO L231 Difference]: Finished difference. Result has 335 places, 325 transitions, 691 flow [2025-03-08 21:36:04,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=335, PETRI_TRANSITIONS=325} [2025-03-08 21:36:04,291 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -18 predicate places. [2025-03-08 21:36:04,291 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 325 transitions, 691 flow [2025-03-08 21:36:04,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:04,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:04,292 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] [2025-03-08 21:36:04,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:36:04,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:04,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash -388687685, now seen corresponding path program 1 times [2025-03-08 21:36:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376414736] [2025-03-08 21:36:04,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:04,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:36:04,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:36:04,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:04,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:04,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-03-08 21:36:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376414736] [2025-03-08 21:36:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376414736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119901907] [2025-03-08 21:36:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:04,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:04,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:04,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:04,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 369 [2025-03-08 21:36:04,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 325 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:04,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:04,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 369 [2025-03-08 21:36:04,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:04,883 INFO L124 PetriNetUnfolderBase]: 892/6890 cut-off events. [2025-03-08 21:36:04,884 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-08 21:36:04,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8651 conditions, 6890 events. 892/6890 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 69770 event pairs, 772 based on Foata normal form. 0/5806 useless extension candidates. Maximal degree in co-relation 7876. Up to 1414 conditions per place. [2025-03-08 21:36:04,920 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-03-08 21:36:04,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 322 transitions, 739 flow [2025-03-08 21:36:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1003 transitions. [2025-03-08 21:36:04,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060523938572719 [2025-03-08 21:36:04,923 INFO L175 Difference]: Start difference. First operand has 335 places, 325 transitions, 691 flow. Second operand 3 states and 1003 transitions. [2025-03-08 21:36:04,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 322 transitions, 739 flow [2025-03-08 21:36:04,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 322 transitions, 739 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:36:04,928 INFO L231 Difference]: Finished difference. Result has 325 places, 322 transitions, 693 flow [2025-03-08 21:36:04,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=325, PETRI_TRANSITIONS=322} [2025-03-08 21:36:04,929 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -28 predicate places. [2025-03-08 21:36:04,929 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 322 transitions, 693 flow [2025-03-08 21:36:04,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:04,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:04,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] [2025-03-08 21:36:04,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:36:04,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:04,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:04,930 INFO L85 PathProgramCache]: Analyzing trace with hash 159583785, now seen corresponding path program 1 times [2025-03-08 21:36:04,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:04,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623617807] [2025-03-08 21:36:04,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:04,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 21:36:04,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 21:36:04,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:04,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:04,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:04,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623617807] [2025-03-08 21:36:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623617807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:04,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:04,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550351346] [2025-03-08 21:36:04,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:04,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:04,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:04,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:04,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-08 21:36:04,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 322 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:04,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:04,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-08 21:36:04,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:05,515 INFO L124 PetriNetUnfolderBase]: 544/4903 cut-off events. [2025-03-08 21:36:05,516 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-08 21:36:05,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6099 conditions, 4903 events. 544/4903 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 47227 event pairs, 456 based on Foata normal form. 0/4156 useless extension candidates. Maximal degree in co-relation 5547. Up to 902 conditions per place. [2025-03-08 21:36:05,556 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-03-08 21:36:05,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 321 transitions, 745 flow [2025-03-08 21:36:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2025-03-08 21:36:05,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087624209575429 [2025-03-08 21:36:05,559 INFO L175 Difference]: Start difference. First operand has 325 places, 322 transitions, 693 flow. Second operand 3 states and 1006 transitions. [2025-03-08 21:36:05,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 321 transitions, 745 flow [2025-03-08 21:36:05,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 321 transitions, 745 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:36:05,565 INFO L231 Difference]: Finished difference. Result has 326 places, 321 transitions, 695 flow [2025-03-08 21:36:05,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=326, PETRI_TRANSITIONS=321} [2025-03-08 21:36:05,566 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -27 predicate places. [2025-03-08 21:36:05,566 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 321 transitions, 695 flow [2025-03-08 21:36:05,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:05,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:05,567 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] [2025-03-08 21:36:05,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:36:05,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:05,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash -606254864, now seen corresponding path program 1 times [2025-03-08 21:36:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:05,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629333771] [2025-03-08 21:36:05,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:05,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:05,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 21:36:05,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 21:36:05,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:05,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629333771] [2025-03-08 21:36:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629333771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:05,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:05,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:05,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3279455] [2025-03-08 21:36:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:05,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:05,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:05,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:05,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 369 [2025-03-08 21:36:05,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 321 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:05,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:05,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 369 [2025-03-08 21:36:05,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:05,957 INFO L124 PetriNetUnfolderBase]: 344/3671 cut-off events. [2025-03-08 21:36:05,957 INFO L125 PetriNetUnfolderBase]: For 210/266 co-relation queries the response was YES. [2025-03-08 21:36:05,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 3671 events. 344/3671 cut-off events. For 210/266 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 33339 event pairs, 280 based on Foata normal form. 2/3100 useless extension candidates. Maximal degree in co-relation 4113. Up to 588 conditions per place. [2025-03-08 21:36:05,976 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 24 selfloop transitions, 0 changer transitions 1/320 dead transitions. [2025-03-08 21:36:05,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 320 transitions, 740 flow [2025-03-08 21:36:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2025-03-08 21:36:05,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9096657633242999 [2025-03-08 21:36:05,980 INFO L175 Difference]: Start difference. First operand has 326 places, 321 transitions, 695 flow. Second operand 3 states and 1007 transitions. [2025-03-08 21:36:05,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 320 transitions, 740 flow [2025-03-08 21:36:05,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 320 transitions, 732 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-08 21:36:05,985 INFO L231 Difference]: Finished difference. Result has 325 places, 319 transitions, 682 flow [2025-03-08 21:36:05,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=325, PETRI_TRANSITIONS=319} [2025-03-08 21:36:05,987 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -28 predicate places. [2025-03-08 21:36:05,987 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 319 transitions, 682 flow [2025-03-08 21:36:05,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:05,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:05,988 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] [2025-03-08 21:36:05,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:36:05,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:05,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1693049353, now seen corresponding path program 1 times [2025-03-08 21:36:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325224599] [2025-03-08 21:36:05,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:05,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 21:36:05,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 21:36:05,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:05,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:06,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:06,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325224599] [2025-03-08 21:36:06,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325224599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:06,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:06,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:06,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636544311] [2025-03-08 21:36:06,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:06,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:06,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:06,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:06,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:06,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 369 [2025-03-08 21:36:06,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 319 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:06,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:06,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 369 [2025-03-08 21:36:06,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:06,304 INFO L124 PetriNetUnfolderBase]: 154/2608 cut-off events. [2025-03-08 21:36:06,304 INFO L125 PetriNetUnfolderBase]: For 210/266 co-relation queries the response was YES. [2025-03-08 21:36:06,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3110 conditions, 2608 events. 154/2608 cut-off events. For 210/266 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 20195 event pairs, 116 based on Foata normal form. 0/2260 useless extension candidates. Maximal degree in co-relation 3103. Up to 147 conditions per place. [2025-03-08 21:36:06,324 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 35 selfloop transitions, 1 changer transitions 0/335 dead transitions. [2025-03-08 21:36:06,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 335 transitions, 804 flow [2025-03-08 21:36:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-03-08 21:36:06,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938572719060524 [2025-03-08 21:36:06,326 INFO L175 Difference]: Start difference. First operand has 325 places, 319 transitions, 682 flow. Second operand 3 states and 1039 transitions. [2025-03-08 21:36:06,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 335 transitions, 804 flow [2025-03-08 21:36:06,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 335 transitions, 802 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:06,331 INFO L231 Difference]: Finished difference. Result has 324 places, 318 transitions, 680 flow [2025-03-08 21:36:06,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=324, PETRI_TRANSITIONS=318} [2025-03-08 21:36:06,331 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -29 predicate places. [2025-03-08 21:36:06,332 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 318 transitions, 680 flow [2025-03-08 21:36:06,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:06,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:06,332 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] [2025-03-08 21:36:06,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:36:06,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -743192015, now seen corresponding path program 1 times [2025-03-08 21:36:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438010751] [2025-03-08 21:36:06,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:06,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 21:36:06,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 21:36:06,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:06,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:06,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438010751] [2025-03-08 21:36:06,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438010751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:06,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:06,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:06,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894833219] [2025-03-08 21:36:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:06,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:06,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:06,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:06,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:06,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 369 [2025-03-08 21:36:06,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 318 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:06,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:06,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 369 [2025-03-08 21:36:06,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:06,791 INFO L124 PetriNetUnfolderBase]: 728/5154 cut-off events. [2025-03-08 21:36:06,791 INFO L125 PetriNetUnfolderBase]: For 302/452 co-relation queries the response was YES. [2025-03-08 21:36:06,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6720 conditions, 5154 events. 728/5154 cut-off events. For 302/452 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 51603 event pairs, 644 based on Foata normal form. 0/4296 useless extension candidates. Maximal degree in co-relation 6713. Up to 1238 conditions per place. [2025-03-08 21:36:06,825 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 29 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2025-03-08 21:36:06,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 317 transitions, 740 flow [2025-03-08 21:36:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2025-03-08 21:36:06,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015356820234869 [2025-03-08 21:36:06,827 INFO L175 Difference]: Start difference. First operand has 324 places, 318 transitions, 680 flow. Second operand 3 states and 998 transitions. [2025-03-08 21:36:06,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 317 transitions, 740 flow [2025-03-08 21:36:06,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 317 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:06,831 INFO L231 Difference]: Finished difference. Result has 324 places, 317 transitions, 681 flow [2025-03-08 21:36:06,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=681, PETRI_PLACES=324, PETRI_TRANSITIONS=317} [2025-03-08 21:36:06,832 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -29 predicate places. [2025-03-08 21:36:06,832 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 317 transitions, 681 flow [2025-03-08 21:36:06,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:06,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:06,833 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] [2025-03-08 21:36:06,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:36:06,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:06,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:06,834 INFO L85 PathProgramCache]: Analyzing trace with hash 574355223, now seen corresponding path program 1 times [2025-03-08 21:36:06,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:06,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118635515] [2025-03-08 21:36:06,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:06,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:36:06,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:36:06,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:06,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:06,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:06,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118635515] [2025-03-08 21:36:06,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118635515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:06,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:06,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:06,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462092004] [2025-03-08 21:36:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:06,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:06,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:06,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-08 21:36:06,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 317 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:06,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:06,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-08 21:36:06,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:07,347 INFO L124 PetriNetUnfolderBase]: 710/5735 cut-off events. [2025-03-08 21:36:07,348 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-08 21:36:07,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7195 conditions, 5735 events. 710/5735 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 57109 event pairs, 608 based on Foata normal form. 0/4836 useless extension candidates. Maximal degree in co-relation 7188. Up to 1136 conditions per place. [2025-03-08 21:36:07,383 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2025-03-08 21:36:07,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 316 transitions, 733 flow [2025-03-08 21:36:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2025-03-08 21:36:07,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087624209575429 [2025-03-08 21:36:07,385 INFO L175 Difference]: Start difference. First operand has 324 places, 317 transitions, 681 flow. Second operand 3 states and 1006 transitions. [2025-03-08 21:36:07,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 316 transitions, 733 flow [2025-03-08 21:36:07,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 316 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:07,389 INFO L231 Difference]: Finished difference. Result has 323 places, 316 transitions, 679 flow [2025-03-08 21:36:07,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=323, PETRI_TRANSITIONS=316} [2025-03-08 21:36:07,392 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -30 predicate places. [2025-03-08 21:36:07,392 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 316 transitions, 679 flow [2025-03-08 21:36:07,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:07,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:07,393 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] [2025-03-08 21:36:07,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:36:07,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:07,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:07,393 INFO L85 PathProgramCache]: Analyzing trace with hash -654608070, now seen corresponding path program 1 times [2025-03-08 21:36:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:07,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229822683] [2025-03-08 21:36:07,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:07,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 21:36:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 21:36:07,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:07,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:07,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229822683] [2025-03-08 21:36:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229822683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:07,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:07,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251961075] [2025-03-08 21:36:07,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:07,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:07,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:07,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:07,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 369 [2025-03-08 21:36:07,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 316 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:07,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 369 [2025-03-08 21:36:07,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:07,830 INFO L124 PetriNetUnfolderBase]: 548/4443 cut-off events. [2025-03-08 21:36:07,830 INFO L125 PetriNetUnfolderBase]: For 262/328 co-relation queries the response was YES. [2025-03-08 21:36:07,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5669 conditions, 4443 events. 548/4443 cut-off events. For 262/328 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 43150 event pairs, 472 based on Foata normal form. 0/3780 useless extension candidates. Maximal degree in co-relation 5662. Up to 932 conditions per place. [2025-03-08 21:36:07,862 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 26 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-03-08 21:36:07,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 315 transitions, 733 flow [2025-03-08 21:36:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2025-03-08 21:36:07,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069557362240289 [2025-03-08 21:36:07,864 INFO L175 Difference]: Start difference. First operand has 323 places, 316 transitions, 679 flow. Second operand 3 states and 1004 transitions. [2025-03-08 21:36:07,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 315 transitions, 733 flow [2025-03-08 21:36:07,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 315 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:07,870 INFO L231 Difference]: Finished difference. Result has 322 places, 315 transitions, 677 flow [2025-03-08 21:36:07,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=322, PETRI_TRANSITIONS=315} [2025-03-08 21:36:07,872 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -31 predicate places. [2025-03-08 21:36:07,872 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 315 transitions, 677 flow [2025-03-08 21:36:07,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:07,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:07,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:07,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:36:07,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:07,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1870564210, now seen corresponding path program 1 times [2025-03-08 21:36:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:07,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259705454] [2025-03-08 21:36:07,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:07,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 21:36:07,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 21:36:07,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:07,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259705454] [2025-03-08 21:36:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259705454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:07,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:07,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:07,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120900749] [2025-03-08 21:36:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:07,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:07,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:07,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:07,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 369 [2025-03-08 21:36:07,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 315 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:07,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:07,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 369 [2025-03-08 21:36:07,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:08,359 INFO L124 PetriNetUnfolderBase]: 570/5393 cut-off events. [2025-03-08 21:36:08,359 INFO L125 PetriNetUnfolderBase]: For 502/1440 co-relation queries the response was YES. [2025-03-08 21:36:08,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6926 conditions, 5393 events. 570/5393 cut-off events. For 502/1440 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 52012 event pairs, 436 based on Foata normal form. 0/4770 useless extension candidates. Maximal degree in co-relation 6919. Up to 1010 conditions per place. [2025-03-08 21:36:08,448 INFO L140 encePairwiseOnDemand]: 360/369 looper letters, 33 selfloop transitions, 1 changer transitions 0/307 dead transitions. [2025-03-08 21:36:08,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 307 transitions, 729 flow [2025-03-08 21:36:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2025-03-08 21:36:08,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8834688346883469 [2025-03-08 21:36:08,450 INFO L175 Difference]: Start difference. First operand has 322 places, 315 transitions, 677 flow. Second operand 3 states and 978 transitions. [2025-03-08 21:36:08,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 307 transitions, 729 flow [2025-03-08 21:36:08,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 307 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:08,453 INFO L231 Difference]: Finished difference. Result has 314 places, 307 transitions, 659 flow [2025-03-08 21:36:08,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=314, PETRI_TRANSITIONS=307} [2025-03-08 21:36:08,454 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -39 predicate places. [2025-03-08 21:36:08,454 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 307 transitions, 659 flow [2025-03-08 21:36:08,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:08,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:08,455 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] [2025-03-08 21:36:08,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:36:08,455 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:08,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1665519408, now seen corresponding path program 1 times [2025-03-08 21:36:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826623847] [2025-03-08 21:36:08,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:08,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:08,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 21:36:08,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 21:36:08,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:08,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826623847] [2025-03-08 21:36:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826623847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:08,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270341459] [2025-03-08 21:36:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:08,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:08,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:08,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:08,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 369 [2025-03-08 21:36:08,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 307 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:08,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:08,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 369 [2025-03-08 21:36:08,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:08,761 INFO L124 PetriNetUnfolderBase]: 382/3569 cut-off events. [2025-03-08 21:36:08,761 INFO L125 PetriNetUnfolderBase]: For 446/522 co-relation queries the response was YES. [2025-03-08 21:36:08,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 3569 events. 382/3569 cut-off events. For 446/522 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 30205 event pairs, 276 based on Foata normal form. 0/3238 useless extension candidates. Maximal degree in co-relation 4645. Up to 682 conditions per place. [2025-03-08 21:36:08,784 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 27 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2025-03-08 21:36:08,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 302 transitions, 705 flow [2025-03-08 21:36:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 996 transitions. [2025-03-08 21:36:08,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8997289972899729 [2025-03-08 21:36:08,786 INFO L175 Difference]: Start difference. First operand has 314 places, 307 transitions, 659 flow. Second operand 3 states and 996 transitions. [2025-03-08 21:36:08,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 302 transitions, 705 flow [2025-03-08 21:36:08,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 302 transitions, 704 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:08,790 INFO L231 Difference]: Finished difference. Result has 310 places, 302 transitions, 650 flow [2025-03-08 21:36:08,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=310, PETRI_TRANSITIONS=302} [2025-03-08 21:36:08,792 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -43 predicate places. [2025-03-08 21:36:08,792 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 302 transitions, 650 flow [2025-03-08 21:36:08,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:08,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:08,793 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-03-08 21:36:08,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:36:08,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:08,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1523098257, now seen corresponding path program 1 times [2025-03-08 21:36:08,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:08,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143412149] [2025-03-08 21:36:08,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:08,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 21:36:08,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 21:36:08,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:08,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143412149] [2025-03-08 21:36:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143412149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:36:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222695967] [2025-03-08 21:36:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:09,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:36:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:09,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:36:09,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:36:09,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 369 [2025-03-08 21:36:09,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 302 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 303.6666666666667) internal successors, (1822), 6 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:09,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:09,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 369 [2025-03-08 21:36:09,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:11,151 INFO L124 PetriNetUnfolderBase]: 3564/20685 cut-off events. [2025-03-08 21:36:11,151 INFO L125 PetriNetUnfolderBase]: For 196/204 co-relation queries the response was YES. [2025-03-08 21:36:11,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27100 conditions, 20685 events. 3564/20685 cut-off events. For 196/204 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 262065 event pairs, 3146 based on Foata normal form. 0/18636 useless extension candidates. Maximal degree in co-relation 27093. Up to 5453 conditions per place. [2025-03-08 21:36:11,229 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 69 selfloop transitions, 6 changer transitions 0/325 dead transitions. [2025-03-08 21:36:11,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 325 transitions, 846 flow [2025-03-08 21:36:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:36:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:36:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1888 transitions. [2025-03-08 21:36:11,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8527551942186089 [2025-03-08 21:36:11,232 INFO L175 Difference]: Start difference. First operand has 310 places, 302 transitions, 650 flow. Second operand 6 states and 1888 transitions. [2025-03-08 21:36:11,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 325 transitions, 846 flow [2025-03-08 21:36:11,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 325 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:11,238 INFO L231 Difference]: Finished difference. Result has 313 places, 301 transitions, 659 flow [2025-03-08 21:36:11,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=659, PETRI_PLACES=313, PETRI_TRANSITIONS=301} [2025-03-08 21:36:11,239 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -40 predicate places. [2025-03-08 21:36:11,239 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 301 transitions, 659 flow [2025-03-08 21:36:11,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 303.6666666666667) internal successors, (1822), 6 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:11,240 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] [2025-03-08 21:36:11,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:36:11,241 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:11,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 285537328, now seen corresponding path program 1 times [2025-03-08 21:36:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169785067] [2025-03-08 21:36:11,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:11,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 21:36:11,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 21:36:11,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:11,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169785067] [2025-03-08 21:36:11,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169785067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:11,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:11,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:36:11,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506914959] [2025-03-08 21:36:11,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:11,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:36:11,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:11,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:36:11,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:36:11,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 369 [2025-03-08 21:36:11,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 301 transitions, 659 flow. Second operand has 4 states, 4 states have (on average 323.5) internal successors, (1294), 4 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:11,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 369 [2025-03-08 21:36:11,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:11,959 INFO L124 PetriNetUnfolderBase]: 842/6391 cut-off events. [2025-03-08 21:36:11,959 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-08 21:36:11,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8134 conditions, 6391 events. 842/6391 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 64411 event pairs, 643 based on Foata normal form. 50/5865 useless extension candidates. Maximal degree in co-relation 8127. Up to 913 conditions per place. [2025-03-08 21:36:11,984 INFO L140 encePairwiseOnDemand]: 356/369 looper letters, 64 selfloop transitions, 11 changer transitions 1/345 dead transitions. [2025-03-08 21:36:11,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 345 transitions, 923 flow [2025-03-08 21:36:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:36:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 21:36:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1366 transitions. [2025-03-08 21:36:11,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254742547425474 [2025-03-08 21:36:11,987 INFO L175 Difference]: Start difference. First operand has 313 places, 301 transitions, 659 flow. Second operand 4 states and 1366 transitions. [2025-03-08 21:36:11,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 345 transitions, 923 flow [2025-03-08 21:36:11,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 345 transitions, 911 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:36:11,991 INFO L231 Difference]: Finished difference. Result has 313 places, 310 transitions, 729 flow [2025-03-08 21:36:11,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=729, PETRI_PLACES=313, PETRI_TRANSITIONS=310} [2025-03-08 21:36:11,993 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -40 predicate places. [2025-03-08 21:36:11,993 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 729 flow [2025-03-08 21:36:11,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 323.5) internal successors, (1294), 4 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:11,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:11,994 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] [2025-03-08 21:36:11,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:36:11,994 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting funcAErr7ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:11,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1756818159, now seen corresponding path program 1 times [2025-03-08 21:36:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329359737] [2025-03-08 21:36:11,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:12,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 21:36:12,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 21:36:12,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:12,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329359737] [2025-03-08 21:36:12,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329359737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:12,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:12,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:12,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047433283] [2025-03-08 21:36:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:12,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:12,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:12,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:12,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:12,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 369 [2025-03-08 21:36:12,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 310 transitions, 729 flow. Second operand has 3 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:12,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:12,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 369 [2025-03-08 21:36:12,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:12,406 INFO L124 PetriNetUnfolderBase]: 306/3163 cut-off events. [2025-03-08 21:36:12,406 INFO L125 PetriNetUnfolderBase]: For 297/481 co-relation queries the response was YES. [2025-03-08 21:36:12,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4220 conditions, 3163 events. 306/3163 cut-off events. For 297/481 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 26687 event pairs, 204 based on Foata normal form. 2/2898 useless extension candidates. Maximal degree in co-relation 4211. Up to 523 conditions per place. [2025-03-08 21:36:12,418 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 32 selfloop transitions, 5 changer transitions 0/322 dead transitions. [2025-03-08 21:36:12,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 322 transitions, 836 flow [2025-03-08 21:36:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2025-03-08 21:36:12,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-08 21:36:12,420 INFO L175 Difference]: Start difference. First operand has 313 places, 310 transitions, 729 flow. Second operand 3 states and 1025 transitions. [2025-03-08 21:36:12,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 322 transitions, 836 flow [2025-03-08 21:36:12,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 322 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:12,423 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 765 flow [2025-03-08 21:36:12,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2025-03-08 21:36:12,424 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -37 predicate places. [2025-03-08 21:36:12,424 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 765 flow [2025-03-08 21:36:12,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:12,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:12,425 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:12,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:36:12,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-08 21:36:12,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash -462329672, now seen corresponding path program 1 times [2025-03-08 21:36:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135572342] [2025-03-08 21:36:12,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:12,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 21:36:12,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 21:36:12,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:12,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:36:12,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:36:12,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 21:36:12,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 21:36:12,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:12,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:36:12,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:36:12,498 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:36:12,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr8ASSERT_VIOLATIONDATA_RACE (63 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr7ASSERT_VIOLATIONDATA_RACE (62 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (61 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (60 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (59 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (58 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (57 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (56 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (55 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (54 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (53 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (52 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (51 of 65 remaining) [2025-03-08 21:36:12,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (50 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (49 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (48 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (47 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (46 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (45 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (44 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (43 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (41 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (40 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (39 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (35 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (33 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (26 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (25 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (24 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (23 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (22 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (21 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (20 of 65 remaining) [2025-03-08 21:36:12,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (19 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (18 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr8ASSERT_VIOLATIONDATA_RACE (17 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr7ASSERT_VIOLATIONDATA_RACE (16 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (15 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (14 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (13 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (12 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (11 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (10 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (9 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (8 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (7 of 65 remaining) [2025-03-08 21:36:12,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (6 of 65 remaining) [2025-03-08 21:36:12,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (5 of 65 remaining) [2025-03-08 21:36:12,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (4 of 65 remaining) [2025-03-08 21:36:12,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (3 of 65 remaining) [2025-03-08 21:36:12,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (2 of 65 remaining) [2025-03-08 21:36:12,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (1 of 65 remaining) [2025-03-08 21:36:12,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (0 of 65 remaining) [2025-03-08 21:36:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:36:12,503 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:12,505 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:36:12,505 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 21:36:12,548 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-08 21:36:12,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 463 places, 482 transitions, 1008 flow [2025-03-08 21:36:12,836 INFO L124 PetriNetUnfolderBase]: 163/1982 cut-off events. [2025-03-08 21:36:12,836 INFO L125 PetriNetUnfolderBase]: For 72/74 co-relation queries the response was YES. [2025-03-08 21:36:12,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2071 conditions, 1982 events. 163/1982 cut-off events. For 72/74 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 12581 event pairs, 1 based on Foata normal form. 0/1619 useless extension candidates. Maximal degree in co-relation 1175. Up to 32 conditions per place. [2025-03-08 21:36:12,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 463 places, 482 transitions, 1008 flow [2025-03-08 21:36:12,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 463 places, 482 transitions, 1008 flow [2025-03-08 21:36:12,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:36:12,887 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;@76a1a04f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:36:12,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-03-08 21:36:12,889 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:36:12,889 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-08 21:36:12,889 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:36:12,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:12,889 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] [2025-03-08 21:36:12,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-08 21:36:12,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash -255241203, now seen corresponding path program 1 times [2025-03-08 21:36:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:12,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250449761] [2025-03-08 21:36:12,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:12,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 21:36:12,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 21:36:12,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:12,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:12,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:12,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250449761] [2025-03-08 21:36:12,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250449761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:12,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:12,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:12,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244645421] [2025-03-08 21:36:12,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:12,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:12,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:12,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:12,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 482 [2025-03-08 21:36:12,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 482 transitions, 1008 flow. Second operand has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:12,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:12,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 482 [2025-03-08 21:36:12,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:31,961 INFO L124 PetriNetUnfolderBase]: 33456/146489 cut-off events. [2025-03-08 21:36:31,961 INFO L125 PetriNetUnfolderBase]: For 12029/12029 co-relation queries the response was YES. [2025-03-08 21:36:33,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194932 conditions, 146489 events. 33456/146489 cut-off events. For 12029/12029 co-relation queries the response was YES. Maximal size of possible extension queue 2630. Compared 2356458 event pairs, 30562 based on Foata normal form. 17228/140824 useless extension candidates. Maximal degree in co-relation 160782. Up to 43633 conditions per place. [2025-03-08 21:36:34,649 INFO L140 encePairwiseOnDemand]: 461/482 looper letters, 42 selfloop transitions, 1 changer transitions 8/458 dead transitions. [2025-03-08 21:36:34,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 458 transitions, 1046 flow [2025-03-08 21:36:34,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2025-03-08 21:36:34,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087136929460581 [2025-03-08 21:36:34,652 INFO L175 Difference]: Start difference. First operand has 463 places, 482 transitions, 1008 flow. Second operand 3 states and 1314 transitions. [2025-03-08 21:36:34,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 458 transitions, 1046 flow [2025-03-08 21:36:34,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 458 transitions, 1046 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:36:34,697 INFO L231 Difference]: Finished difference. Result has 457 places, 450 transitions, 946 flow [2025-03-08 21:36:34,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=457, PETRI_TRANSITIONS=450} [2025-03-08 21:36:34,698 INFO L279 CegarLoopForPetriNet]: 463 programPoint places, -6 predicate places. [2025-03-08 21:36:34,698 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 450 transitions, 946 flow [2025-03-08 21:36:34,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:34,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:34,699 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] [2025-03-08 21:36:34,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:36:34,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [funcAErr8ASSERT_VIOLATIONDATA_RACE, funcAErr7ASSERT_VIOLATIONDATA_RACE, funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-03-08 21:36:34,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash 677487933, now seen corresponding path program 1 times [2025-03-08 21:36:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:34,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414644338] [2025-03-08 21:36:34,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:34,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:34,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 21:36:34,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 21:36:34,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:34,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:34,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414644338] [2025-03-08 21:36:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414644338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287461475] [2025-03-08 21:36:34,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:34,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:34,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:34,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:34,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 482 [2025-03-08 21:36:34,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 450 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:34,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:34,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 482 [2025-03-08 21:36:34,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand