./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 735b3cc8 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-?-735b3cc-m [2025-03-14 01:16:43,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:16:43,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:16:43,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:16:43,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:16:43,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:16:43,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:16:43,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:16:43,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:16:43,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:16:43,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:16:43,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:16:43,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:16:43,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:16:43,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:16:43,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:16:43,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:16:43,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:16:43,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:16:43,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:16:43,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:16:43,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:16:43,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:16:43,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:16:43,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:16:43,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:16:43,492 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-14 01:16:43,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:16:43,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:16:43,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:16:43,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:16:43,724 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:16:43,725 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-14 01:16:44,873 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcebff9d/596bcd97fd8d4b91b3062f42b5c316da/FLAG2a5ff9a88 [2025-03-14 01:16:45,203 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:16:45,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-03-14 01:16:45,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcebff9d/596bcd97fd8d4b91b3062f42b5c316da/FLAG2a5ff9a88 [2025-03-14 01:16:45,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcebff9d/596bcd97fd8d4b91b3062f42b5c316da [2025-03-14 01:16:45,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:16:45,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:16:45,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:16:45,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:16:45,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:16:45,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:16:45" (1/1) ... [2025-03-14 01:16:45,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5532132c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:45, skipping insertion in model container [2025-03-14 01:16:45,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:16:45" (1/1) ... [2025-03-14 01:16:45,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:16:45,889 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-14 01:16:45,889 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-14 01:16:45,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:16:45,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:16:45,961 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-14 01:16:45,964 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-14 01:16:45,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:16:46,020 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:16:46,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46 WrapperNode [2025-03-14 01:16:46,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:16:46,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:16:46,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:16:46,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:16:46,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,054 INFO L138 Inliner]: procedures = 373, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 272 [2025-03-14 01:16:46,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:16:46,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:16:46,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:16:46,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:16:46,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:16:46,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:16:46,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:16:46,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:16:46,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (1/1) ... [2025-03-14 01:16:46,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:16:46,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:46,109 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-14 01:16:46,111 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-14 01:16:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-03-14 01:16:46,128 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-03-14 01:16:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-03-14 01:16:46,128 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:16:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:16:46,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:16:46,130 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:16:46,243 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:16:46,244 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:16:46,666 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1301: havoc main_~#tPool~0#1.base, main_~#tPool~0#1.offset; [2025-03-14 01:16:46,667 INFO L1326 $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-14 01:16:46,667 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1302: havoc main_~#rPool~0#1.base, main_~#rPool~0#1.offset; [2025-03-14 01:16:46,667 INFO L1326 $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-14 01:16:46,702 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:16:46,703 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:16:46,703 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:16:46,732 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:16:46,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:16:46 BoogieIcfgContainer [2025-03-14 01:16:46,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:16:46,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:16:46,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:16:46,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:16:46,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:16:45" (1/3) ... [2025-03-14 01:16:46,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d73723f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:16:46, skipping insertion in model container [2025-03-14 01:16:46,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:46" (2/3) ... [2025-03-14 01:16:46,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d73723f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:16:46, skipping insertion in model container [2025-03-14 01:16:46,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:16:46" (3/3) ... [2025-03-14 01:16:46,743 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-03-14 01:16:46,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:16:46,754 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-14 01:16:46,754 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:16:46,822 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:16:46,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 369 transitions, 758 flow [2025-03-14 01:16:47,002 INFO L124 PetriNetUnfolderBase]: 43/682 cut-off events. [2025-03-14 01:16:47,005 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-14 01:16:47,017 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-14 01:16:47,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 369 transitions, 758 flow [2025-03-14 01:16:47,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 353 places, 369 transitions, 758 flow [2025-03-14 01:16:47,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:16:47,046 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;@536aedda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:16:47,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-14 01:16:47,052 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:16:47,052 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-14 01:16:47,052 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:16:47,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:47,052 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-14 01:16:47,053 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-14 01:16:47,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:47,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2006078931, now seen corresponding path program 1 times [2025-03-14 01:16:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:47,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870315990] [2025-03-14 01:16:47,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:47,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:16:47,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:16:47,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:47,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:47,225 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-14 01:16:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:47,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870315990] [2025-03-14 01:16:47,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870315990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:47,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:47,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:47,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922505711] [2025-03-14 01:16:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:47,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:47,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:47,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:47,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 369 [2025-03-14 01:16:47,288 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-14 01:16:47,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:47,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 369 [2025-03-14 01:16:47,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:47,698 INFO L124 PetriNetUnfolderBase]: 271/2560 cut-off events. [2025-03-14 01:16:47,699 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-14 01:16:47,706 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-14 01:16:47,718 INFO L140 encePairwiseOnDemand]: 350/369 looper letters, 25 selfloop transitions, 1 changer transitions 8/349 dead transitions. [2025-03-14 01:16:47,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 349 transitions, 770 flow [2025-03-14 01:16:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-03-14 01:16:47,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9177958446251129 [2025-03-14 01:16:47,736 INFO L175 Difference]: Start difference. First operand has 353 places, 369 transitions, 758 flow. Second operand 3 states and 1016 transitions. [2025-03-14 01:16:47,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 349 transitions, 770 flow [2025-03-14 01:16:47,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 349 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:47,749 INFO L231 Difference]: Finished difference. Result has 349 places, 341 transitions, 704 flow [2025-03-14 01:16:47,752 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-14 01:16:47,754 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -4 predicate places. [2025-03-14 01:16:47,755 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 341 transitions, 704 flow [2025-03-14 01:16:47,756 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-14 01:16:47,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:47,756 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-14 01:16:47,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:16:47,757 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-14 01:16:47,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2058874563, now seen corresponding path program 1 times [2025-03-14 01:16:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:47,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535519121] [2025-03-14 01:16:47,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:47,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:16:47,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:16:47,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:47,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:47,843 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-14 01:16:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:47,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535519121] [2025-03-14 01:16:47,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535519121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:47,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:47,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544374382] [2025-03-14 01:16:47,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:47,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:47,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:47,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:47,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 369 [2025-03-14 01:16:47,861 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-14 01:16:47,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:47,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 369 [2025-03-14 01:16:47,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:48,256 INFO L124 PetriNetUnfolderBase]: 152/2660 cut-off events. [2025-03-14 01:16:48,257 INFO L125 PetriNetUnfolderBase]: For 210/266 co-relation queries the response was YES. [2025-03-14 01:16:48,265 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-14 01:16:48,276 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 35 selfloop transitions, 1 changer transitions 0/357 dead transitions. [2025-03-14 01:16:48,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 357 transitions, 826 flow [2025-03-14 01:16:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-03-14 01:16:48,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938572719060524 [2025-03-14 01:16:48,291 INFO L175 Difference]: Start difference. First operand has 349 places, 341 transitions, 704 flow. Second operand 3 states and 1039 transitions. [2025-03-14 01:16:48,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 357 transitions, 826 flow [2025-03-14 01:16:48,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 357 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:48,308 INFO L231 Difference]: Finished difference. Result has 341 places, 340 transitions, 703 flow [2025-03-14 01:16:48,309 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-14 01:16:48,310 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -12 predicate places. [2025-03-14 01:16:48,310 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 340 transitions, 703 flow [2025-03-14 01:16:48,311 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-14 01:16:48,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:48,311 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-14 01:16:48,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:16:48,311 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-14 01:16:48,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 599213088, now seen corresponding path program 1 times [2025-03-14 01:16:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465769360] [2025-03-14 01:16:48,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:48,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:16:48,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:16:48,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:48,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:48,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-14 01:16:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:48,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465769360] [2025-03-14 01:16:48,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465769360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:48,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:48,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931958678] [2025-03-14 01:16:48,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:48,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:48,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:48,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:48,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 369 [2025-03-14 01:16:48,385 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-14 01:16:48,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:48,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 369 [2025-03-14 01:16:48,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:49,035 INFO L124 PetriNetUnfolderBase]: 728/3855 cut-off events. [2025-03-14 01:16:49,036 INFO L125 PetriNetUnfolderBase]: For 234/290 co-relation queries the response was YES. [2025-03-14 01:16:49,049 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-14 01:16:49,066 INFO L140 encePairwiseOnDemand]: 353/369 looper letters, 37 selfloop transitions, 5 changer transitions 11/349 dead transitions. [2025-03-14 01:16:49,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 349 transitions, 821 flow [2025-03-14 01:16:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2025-03-14 01:16:49,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8979223125564589 [2025-03-14 01:16:49,069 INFO L175 Difference]: Start difference. First operand has 341 places, 340 transitions, 703 flow. Second operand 3 states and 994 transitions. [2025-03-14 01:16:49,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 349 transitions, 821 flow [2025-03-14 01:16:49,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 349 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:49,075 INFO L231 Difference]: Finished difference. Result has 335 places, 325 transitions, 691 flow [2025-03-14 01:16:49,076 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-14 01:16:49,076 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -18 predicate places. [2025-03-14 01:16:49,077 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 325 transitions, 691 flow [2025-03-14 01:16:49,077 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-14 01:16:49,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:49,077 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-14 01:16:49,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:16:49,077 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-14 01:16:49,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash -388687685, now seen corresponding path program 1 times [2025-03-14 01:16:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906874735] [2025-03-14 01:16:49,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:49,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:16:49,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:16:49,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:49,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:49,134 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-14 01:16:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906874735] [2025-03-14 01:16:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906874735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:49,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:49,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580485129] [2025-03-14 01:16:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:49,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:49,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:49,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:49,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 369 [2025-03-14 01:16:49,157 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-14 01:16:49,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:49,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 369 [2025-03-14 01:16:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:49,713 INFO L124 PetriNetUnfolderBase]: 892/6890 cut-off events. [2025-03-14 01:16:49,714 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-14 01:16:49,736 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-14 01:16:49,758 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-03-14 01:16:49,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 322 transitions, 739 flow [2025-03-14 01:16:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1003 transitions. [2025-03-14 01:16:49,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060523938572719 [2025-03-14 01:16:49,761 INFO L175 Difference]: Start difference. First operand has 335 places, 325 transitions, 691 flow. Second operand 3 states and 1003 transitions. [2025-03-14 01:16:49,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 322 transitions, 739 flow [2025-03-14 01:16:49,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 322 transitions, 739 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:49,767 INFO L231 Difference]: Finished difference. Result has 325 places, 322 transitions, 693 flow [2025-03-14 01:16:49,767 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-14 01:16:49,768 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -28 predicate places. [2025-03-14 01:16:49,768 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 322 transitions, 693 flow [2025-03-14 01:16:49,769 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-14 01:16:49,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:49,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:49,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:16:49,770 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-14 01:16:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash 159583785, now seen corresponding path program 1 times [2025-03-14 01:16:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:49,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719752005] [2025-03-14 01:16:49,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:49,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:16:49,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:16:49,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:49,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:49,817 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-14 01:16:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719752005] [2025-03-14 01:16:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719752005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669185620] [2025-03-14 01:16:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:49,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:49,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:49,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:49,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-14 01:16:49,851 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-14 01:16:49,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:49,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-14 01:16:49,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:50,313 INFO L124 PetriNetUnfolderBase]: 544/4903 cut-off events. [2025-03-14 01:16:50,315 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-14 01:16:50,329 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-14 01:16:50,343 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-03-14 01:16:50,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 321 transitions, 745 flow [2025-03-14 01:16:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2025-03-14 01:16:50,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087624209575429 [2025-03-14 01:16:50,346 INFO L175 Difference]: Start difference. First operand has 325 places, 322 transitions, 693 flow. Second operand 3 states and 1006 transitions. [2025-03-14 01:16:50,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 321 transitions, 745 flow [2025-03-14 01:16:50,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 321 transitions, 745 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:50,355 INFO L231 Difference]: Finished difference. Result has 326 places, 321 transitions, 695 flow [2025-03-14 01:16:50,355 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-14 01:16:50,356 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -27 predicate places. [2025-03-14 01:16:50,356 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 321 transitions, 695 flow [2025-03-14 01:16:50,356 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-14 01:16:50,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:50,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:50,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:16:50,358 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-14 01:16:50,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash -606254864, now seen corresponding path program 1 times [2025-03-14 01:16:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:50,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291334731] [2025-03-14 01:16:50,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:50,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:16:50,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:16:50,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:50,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:50,404 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-14 01:16:50,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291334731] [2025-03-14 01:16:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291334731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:50,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:50,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:16:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489009015] [2025-03-14 01:16:50,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:50,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:50,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:50,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:50,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 369 [2025-03-14 01:16:50,422 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-14 01:16:50,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:50,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 369 [2025-03-14 01:16:50,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:50,902 INFO L124 PetriNetUnfolderBase]: 344/3671 cut-off events. [2025-03-14 01:16:50,903 INFO L125 PetriNetUnfolderBase]: For 210/266 co-relation queries the response was YES. [2025-03-14 01:16:50,919 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-14 01:16:50,931 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 24 selfloop transitions, 0 changer transitions 1/320 dead transitions. [2025-03-14 01:16:50,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 320 transitions, 740 flow [2025-03-14 01:16:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2025-03-14 01:16:50,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9096657633242999 [2025-03-14 01:16:50,934 INFO L175 Difference]: Start difference. First operand has 326 places, 321 transitions, 695 flow. Second operand 3 states and 1007 transitions. [2025-03-14 01:16:50,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 320 transitions, 740 flow [2025-03-14 01:16:50,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 320 transitions, 732 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-14 01:16:50,941 INFO L231 Difference]: Finished difference. Result has 325 places, 319 transitions, 682 flow [2025-03-14 01:16:50,942 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-14 01:16:50,944 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -28 predicate places. [2025-03-14 01:16:50,944 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 319 transitions, 682 flow [2025-03-14 01:16:50,945 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-14 01:16:50,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:50,945 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-14 01:16:50,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:16:50,945 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-14 01:16:50,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1693049353, now seen corresponding path program 1 times [2025-03-14 01:16:50,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:50,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628914288] [2025-03-14 01:16:50,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:50,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:50,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:16:50,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:16:50,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:50,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:51,021 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-14 01:16:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628914288] [2025-03-14 01:16:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628914288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:51,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:51,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215012096] [2025-03-14 01:16:51,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:51,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:51,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:51,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:51,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 369 [2025-03-14 01:16:51,031 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-14 01:16:51,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:51,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 369 [2025-03-14 01:16:51,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:51,360 INFO L124 PetriNetUnfolderBase]: 154/2608 cut-off events. [2025-03-14 01:16:51,360 INFO L125 PetriNetUnfolderBase]: For 210/266 co-relation queries the response was YES. [2025-03-14 01:16:51,372 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-14 01:16:51,381 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 35 selfloop transitions, 1 changer transitions 0/335 dead transitions. [2025-03-14 01:16:51,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 335 transitions, 804 flow [2025-03-14 01:16:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-03-14 01:16:51,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938572719060524 [2025-03-14 01:16:51,384 INFO L175 Difference]: Start difference. First operand has 325 places, 319 transitions, 682 flow. Second operand 3 states and 1039 transitions. [2025-03-14 01:16:51,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 335 transitions, 804 flow [2025-03-14 01:16:51,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 335 transitions, 802 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:51,439 INFO L231 Difference]: Finished difference. Result has 324 places, 318 transitions, 680 flow [2025-03-14 01:16:51,439 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-14 01:16:51,440 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -29 predicate places. [2025-03-14 01:16:51,440 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 318 transitions, 680 flow [2025-03-14 01:16:51,441 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-14 01:16:51,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:51,441 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-14 01:16:51,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:16:51,441 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-14 01:16:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -743192015, now seen corresponding path program 1 times [2025-03-14 01:16:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027558629] [2025-03-14 01:16:51,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:51,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:16:51,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:16:51,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:51,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:51,492 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-14 01:16:51,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:51,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027558629] [2025-03-14 01:16:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027558629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:51,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999132887] [2025-03-14 01:16:51,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:51,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:51,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:51,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 369 [2025-03-14 01:16:51,530 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-14 01:16:51,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:51,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 369 [2025-03-14 01:16:51,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:51,982 INFO L124 PetriNetUnfolderBase]: 728/5154 cut-off events. [2025-03-14 01:16:51,983 INFO L125 PetriNetUnfolderBase]: For 302/452 co-relation queries the response was YES. [2025-03-14 01:16:52,008 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-14 01:16:52,025 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 29 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2025-03-14 01:16:52,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 317 transitions, 740 flow [2025-03-14 01:16:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2025-03-14 01:16:52,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015356820234869 [2025-03-14 01:16:52,027 INFO L175 Difference]: Start difference. First operand has 324 places, 318 transitions, 680 flow. Second operand 3 states and 998 transitions. [2025-03-14 01:16:52,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 317 transitions, 740 flow [2025-03-14 01:16:52,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 317 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:52,032 INFO L231 Difference]: Finished difference. Result has 324 places, 317 transitions, 681 flow [2025-03-14 01:16:52,032 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-14 01:16:52,037 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -29 predicate places. [2025-03-14 01:16:52,037 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 317 transitions, 681 flow [2025-03-14 01:16:52,037 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-14 01:16:52,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:52,037 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-14 01:16:52,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:16:52,038 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-14 01:16:52,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash 574355223, now seen corresponding path program 1 times [2025-03-14 01:16:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:52,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029420650] [2025-03-14 01:16:52,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:52,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:16:52,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:16:52,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:52,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:52,059 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-14 01:16:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029420650] [2025-03-14 01:16:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029420650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:52,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:52,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777220829] [2025-03-14 01:16:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:52,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:52,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:52,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:52,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-14 01:16:52,079 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-14 01:16:52,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:52,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-14 01:16:52,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:52,580 INFO L124 PetriNetUnfolderBase]: 710/5735 cut-off events. [2025-03-14 01:16:52,580 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-14 01:16:52,606 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-14 01:16:52,622 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2025-03-14 01:16:52,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 316 transitions, 733 flow [2025-03-14 01:16:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2025-03-14 01:16:52,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087624209575429 [2025-03-14 01:16:52,625 INFO L175 Difference]: Start difference. First operand has 324 places, 317 transitions, 681 flow. Second operand 3 states and 1006 transitions. [2025-03-14 01:16:52,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 316 transitions, 733 flow [2025-03-14 01:16:52,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 316 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:52,630 INFO L231 Difference]: Finished difference. Result has 323 places, 316 transitions, 679 flow [2025-03-14 01:16:52,631 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-14 01:16:52,631 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -30 predicate places. [2025-03-14 01:16:52,631 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 316 transitions, 679 flow [2025-03-14 01:16:52,632 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-14 01:16:52,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:52,632 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-14 01:16:52,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:16:52,632 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-14 01:16:52,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash -654608070, now seen corresponding path program 1 times [2025-03-14 01:16:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178526662] [2025-03-14 01:16:52,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:52,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:16:52,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:16:52,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:52,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:52,664 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-14 01:16:52,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:52,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178526662] [2025-03-14 01:16:52,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178526662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:52,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:52,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:52,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895947251] [2025-03-14 01:16:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:52,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:52,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:52,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:52,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:52,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 369 [2025-03-14 01:16:52,695 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-14 01:16:52,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:52,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 369 [2025-03-14 01:16:52,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:53,149 INFO L124 PetriNetUnfolderBase]: 548/4443 cut-off events. [2025-03-14 01:16:53,149 INFO L125 PetriNetUnfolderBase]: For 262/328 co-relation queries the response was YES. [2025-03-14 01:16:53,162 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-14 01:16:53,172 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 26 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-03-14 01:16:53,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 315 transitions, 733 flow [2025-03-14 01:16:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2025-03-14 01:16:53,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069557362240289 [2025-03-14 01:16:53,175 INFO L175 Difference]: Start difference. First operand has 323 places, 316 transitions, 679 flow. Second operand 3 states and 1004 transitions. [2025-03-14 01:16:53,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 315 transitions, 733 flow [2025-03-14 01:16:53,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 315 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:53,179 INFO L231 Difference]: Finished difference. Result has 322 places, 315 transitions, 677 flow [2025-03-14 01:16:53,180 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-14 01:16:53,180 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -31 predicate places. [2025-03-14 01:16:53,180 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 315 transitions, 677 flow [2025-03-14 01:16:53,181 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-14 01:16:53,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:53,181 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-14 01:16:53,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:16:53,181 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-14 01:16:53,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1870564210, now seen corresponding path program 1 times [2025-03-14 01:16:53,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:53,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522485627] [2025-03-14 01:16:53,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:53,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-14 01:16:53,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-14 01:16:53,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:53,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:53,220 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-14 01:16:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522485627] [2025-03-14 01:16:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522485627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:53,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531534744] [2025-03-14 01:16:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:53,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:53,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:53,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 369 [2025-03-14 01:16:53,260 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-14 01:16:53,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:53,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 369 [2025-03-14 01:16:53,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:53,693 INFO L124 PetriNetUnfolderBase]: 570/5393 cut-off events. [2025-03-14 01:16:53,693 INFO L125 PetriNetUnfolderBase]: For 502/1440 co-relation queries the response was YES. [2025-03-14 01:16:53,720 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-14 01:16:53,735 INFO L140 encePairwiseOnDemand]: 360/369 looper letters, 33 selfloop transitions, 1 changer transitions 0/307 dead transitions. [2025-03-14 01:16:53,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 307 transitions, 729 flow [2025-03-14 01:16:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2025-03-14 01:16:53,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8834688346883469 [2025-03-14 01:16:53,737 INFO L175 Difference]: Start difference. First operand has 322 places, 315 transitions, 677 flow. Second operand 3 states and 978 transitions. [2025-03-14 01:16:53,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 307 transitions, 729 flow [2025-03-14 01:16:53,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 307 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:53,741 INFO L231 Difference]: Finished difference. Result has 314 places, 307 transitions, 659 flow [2025-03-14 01:16:53,742 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-14 01:16:53,743 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -39 predicate places. [2025-03-14 01:16:53,743 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 307 transitions, 659 flow [2025-03-14 01:16:53,743 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-14 01:16:53,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:53,743 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-14 01:16:53,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:16:53,743 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-14 01:16:53,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1665519408, now seen corresponding path program 1 times [2025-03-14 01:16:53,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:53,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222021586] [2025-03-14 01:16:53,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:53,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:16:53,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:16:53,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:53,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:53,778 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-14 01:16:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222021586] [2025-03-14 01:16:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222021586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580170484] [2025-03-14 01:16:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:53,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:53,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:53,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:53,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 369 [2025-03-14 01:16:53,796 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-14 01:16:53,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:53,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 369 [2025-03-14 01:16:53,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:54,201 INFO L124 PetriNetUnfolderBase]: 382/3569 cut-off events. [2025-03-14 01:16:54,201 INFO L125 PetriNetUnfolderBase]: For 446/522 co-relation queries the response was YES. [2025-03-14 01:16:54,217 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-14 01:16:54,227 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 27 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2025-03-14 01:16:54,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 302 transitions, 705 flow [2025-03-14 01:16:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 996 transitions. [2025-03-14 01:16:54,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8997289972899729 [2025-03-14 01:16:54,231 INFO L175 Difference]: Start difference. First operand has 314 places, 307 transitions, 659 flow. Second operand 3 states and 996 transitions. [2025-03-14 01:16:54,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 302 transitions, 705 flow [2025-03-14 01:16:54,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 302 transitions, 704 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:54,235 INFO L231 Difference]: Finished difference. Result has 310 places, 302 transitions, 650 flow [2025-03-14 01:16:54,236 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-14 01:16:54,238 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -43 predicate places. [2025-03-14 01:16:54,238 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 302 transitions, 650 flow [2025-03-14 01:16:54,238 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-14 01:16:54,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:54,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] [2025-03-14 01:16:54,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:16:54,240 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-14 01:16:54,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1523098257, now seen corresponding path program 1 times [2025-03-14 01:16:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:54,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388599807] [2025-03-14 01:16:54,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:54,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:16:54,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:16:54,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:54,747 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-14 01:16:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388599807] [2025-03-14 01:16:54,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388599807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:54,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:54,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683015540] [2025-03-14 01:16:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:54,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:54,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:54,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:54,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:54,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 369 [2025-03-14 01:16:54,945 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-14 01:16:54,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:54,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 369 [2025-03-14 01:16:54,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:56,576 INFO L124 PetriNetUnfolderBase]: 3564/20685 cut-off events. [2025-03-14 01:16:56,577 INFO L125 PetriNetUnfolderBase]: For 196/204 co-relation queries the response was YES. [2025-03-14 01:16:56,627 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-14 01:16:56,663 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 69 selfloop transitions, 6 changer transitions 0/325 dead transitions. [2025-03-14 01:16:56,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 325 transitions, 846 flow [2025-03-14 01:16:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1888 transitions. [2025-03-14 01:16:56,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8527551942186089 [2025-03-14 01:16:56,666 INFO L175 Difference]: Start difference. First operand has 310 places, 302 transitions, 650 flow. Second operand 6 states and 1888 transitions. [2025-03-14 01:16:56,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 325 transitions, 846 flow [2025-03-14 01:16:56,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 325 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:56,671 INFO L231 Difference]: Finished difference. Result has 313 places, 301 transitions, 659 flow [2025-03-14 01:16:56,672 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-14 01:16:56,673 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -40 predicate places. [2025-03-14 01:16:56,673 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 301 transitions, 659 flow [2025-03-14 01:16:56,674 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-14 01:16:56,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:56,674 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-14 01:16:56,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:16:56,674 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-14 01:16:56,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 285537328, now seen corresponding path program 1 times [2025-03-14 01:16:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580977295] [2025-03-14 01:16:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:56,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:16:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:16:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:56,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:56,761 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-14 01:16:56,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580977295] [2025-03-14 01:16:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580977295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:56,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:16:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271393781] [2025-03-14 01:16:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:56,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:16:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:56,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:16:56,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:16:56,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 369 [2025-03-14 01:16:56,839 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-14 01:16:56,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:56,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 369 [2025-03-14 01:16:56,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:57,365 INFO L124 PetriNetUnfolderBase]: 842/6391 cut-off events. [2025-03-14 01:16:57,365 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-14 01:16:57,391 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-14 01:16:57,406 INFO L140 encePairwiseOnDemand]: 356/369 looper letters, 64 selfloop transitions, 11 changer transitions 1/345 dead transitions. [2025-03-14 01:16:57,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 345 transitions, 923 flow [2025-03-14 01:16:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:16:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:16:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1366 transitions. [2025-03-14 01:16:57,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254742547425474 [2025-03-14 01:16:57,409 INFO L175 Difference]: Start difference. First operand has 313 places, 301 transitions, 659 flow. Second operand 4 states and 1366 transitions. [2025-03-14 01:16:57,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 345 transitions, 923 flow [2025-03-14 01:16:57,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 345 transitions, 911 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:57,416 INFO L231 Difference]: Finished difference. Result has 313 places, 310 transitions, 729 flow [2025-03-14 01:16:57,416 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-14 01:16:57,417 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -40 predicate places. [2025-03-14 01:16:57,417 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 729 flow [2025-03-14 01:16:57,417 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-14 01:16:57,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:57,418 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-14 01:16:57,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:16:57,418 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-14 01:16:57,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1756818159, now seen corresponding path program 1 times [2025-03-14 01:16:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127263972] [2025-03-14 01:16:57,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:57,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-14 01:16:57,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-14 01:16:57,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:57,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:57,463 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-14 01:16:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127263972] [2025-03-14 01:16:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127263972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:57,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:57,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:57,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172023466] [2025-03-14 01:16:57,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:57,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:57,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:57,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:57,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 369 [2025-03-14 01:16:57,488 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-14 01:16:57,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:57,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 369 [2025-03-14 01:16:57,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:57,886 INFO L124 PetriNetUnfolderBase]: 306/3163 cut-off events. [2025-03-14 01:16:57,886 INFO L125 PetriNetUnfolderBase]: For 297/481 co-relation queries the response was YES. [2025-03-14 01:16:57,894 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-14 01:16:57,899 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 32 selfloop transitions, 5 changer transitions 0/322 dead transitions. [2025-03-14 01:16:57,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 322 transitions, 836 flow [2025-03-14 01:16:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2025-03-14 01:16:57,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-14 01:16:57,900 INFO L175 Difference]: Start difference. First operand has 313 places, 310 transitions, 729 flow. Second operand 3 states and 1025 transitions. [2025-03-14 01:16:57,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 322 transitions, 836 flow [2025-03-14 01:16:57,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 322 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:57,904 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 765 flow [2025-03-14 01:16:57,904 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-14 01:16:57,904 INFO L279 CegarLoopForPetriNet]: 353 programPoint places, -37 predicate places. [2025-03-14 01:16:57,904 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 765 flow [2025-03-14 01:16:57,905 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-14 01:16:57,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:57,905 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-14 01:16:57,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:16:57,905 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-14 01:16:57,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash -462329672, now seen corresponding path program 1 times [2025-03-14 01:16:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:57,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659116553] [2025-03-14 01:16:57,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:57,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:16:57,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:16:57,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:57,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:16:57,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:16:57,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:16:57,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:16:57,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:57,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:16:57,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:16:57,974 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:16:57,976 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-03-14 01:16:57,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr8ASSERT_VIOLATIONDATA_RACE (63 of 65 remaining) [2025-03-14 01:16:57,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr7ASSERT_VIOLATIONDATA_RACE (62 of 65 remaining) [2025-03-14 01:16:57,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (61 of 65 remaining) [2025-03-14 01:16:57,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (60 of 65 remaining) [2025-03-14 01:16:57,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (59 of 65 remaining) [2025-03-14 01:16:57,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (58 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (57 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (56 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (55 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (54 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (53 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (52 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (51 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (50 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (49 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (48 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (47 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (46 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (45 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (44 of 65 remaining) [2025-03-14 01:16:57,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (43 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (41 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (40 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (39 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (35 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (33 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 65 remaining) [2025-03-14 01:16:57,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (26 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (25 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (24 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (23 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (22 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (21 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (20 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (19 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (18 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr8ASSERT_VIOLATIONDATA_RACE (17 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr7ASSERT_VIOLATIONDATA_RACE (16 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (15 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (14 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (13 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (12 of 65 remaining) [2025-03-14 01:16:57,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (11 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (10 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (9 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (8 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (7 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (6 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (5 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (4 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (3 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (2 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (1 of 65 remaining) [2025-03-14 01:16:57,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (0 of 65 remaining) [2025-03-14 01:16:57,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:16:57,983 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:57,985 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:16:57,985 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:16:58,025 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-14 01:16:58,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 463 places, 482 transitions, 1008 flow [2025-03-14 01:16:58,212 INFO L124 PetriNetUnfolderBase]: 163/1982 cut-off events. [2025-03-14 01:16:58,212 INFO L125 PetriNetUnfolderBase]: For 72/74 co-relation queries the response was YES. [2025-03-14 01:16:58,245 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-14 01:16:58,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 463 places, 482 transitions, 1008 flow [2025-03-14 01:16:58,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 463 places, 482 transitions, 1008 flow [2025-03-14 01:16:58,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:16:58,263 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;@536aedda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:16:58,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-03-14 01:16:58,264 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:16:58,264 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-14 01:16:58,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:16:58,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:58,264 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-14 01:16:58,264 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-14 01:16:58,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash -255241203, now seen corresponding path program 1 times [2025-03-14 01:16:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410164802] [2025-03-14 01:16:58,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:58,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:16:58,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:16:58,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:58,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:58,280 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-14 01:16:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410164802] [2025-03-14 01:16:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410164802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:58,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99662067] [2025-03-14 01:16:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:58,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:58,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:58,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:58,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 482 [2025-03-14 01:16:58,296 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-14 01:16:58,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:58,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 482 [2025-03-14 01:16:58,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:17,174 INFO L124 PetriNetUnfolderBase]: 33456/146489 cut-off events. [2025-03-14 01:17:17,174 INFO L125 PetriNetUnfolderBase]: For 12029/12029 co-relation queries the response was YES. [2025-03-14 01:17:18,613 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-14 01:17:19,726 INFO L140 encePairwiseOnDemand]: 461/482 looper letters, 42 selfloop transitions, 1 changer transitions 8/458 dead transitions. [2025-03-14 01:17:19,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 458 transitions, 1046 flow [2025-03-14 01:17:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2025-03-14 01:17:19,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087136929460581 [2025-03-14 01:17:19,729 INFO L175 Difference]: Start difference. First operand has 463 places, 482 transitions, 1008 flow. Second operand 3 states and 1314 transitions. [2025-03-14 01:17:19,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 458 transitions, 1046 flow [2025-03-14 01:17:19,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 458 transitions, 1046 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:19,771 INFO L231 Difference]: Finished difference. Result has 457 places, 450 transitions, 946 flow [2025-03-14 01:17:19,771 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-14 01:17:19,772 INFO L279 CegarLoopForPetriNet]: 463 programPoint places, -6 predicate places. [2025-03-14 01:17:19,772 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 450 transitions, 946 flow [2025-03-14 01:17:19,773 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-14 01:17:19,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:19,773 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-14 01:17:19,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:17:19,773 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-14 01:17:19,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 677487933, now seen corresponding path program 1 times [2025-03-14 01:17:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365638121] [2025-03-14 01:17:19,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:19,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:17:19,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:17:19,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:19,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:19,799 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-14 01:17:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:19,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365638121] [2025-03-14 01:17:19,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365638121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:19,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:19,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:17:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530916845] [2025-03-14 01:17:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:19,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:19,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:19,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:19,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 482 [2025-03-14 01:17:19,811 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-14 01:17:19,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:19,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 482 [2025-03-14 01:17:19,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand