./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:24:42,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:24:42,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:24:42,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:24:42,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:24:42,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:24:42,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:24:42,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:24:42,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:24:42,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:24:42,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:24:42,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:24:42,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:24:42,392 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:24:42,393 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:24:42,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:24:42,393 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:24:42,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:24:42,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:24:42,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:24:42,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:24:42,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:24:42,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:24:42,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:24:42,394 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2025-02-06 09:24:42,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:24:42,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:24:42,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:24:42,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:24:42,706 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:24:42,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-02-06 09:24:44,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4f53ca76/f14663e4f8fc455ab47c1f2057dca05b/FLAGb9df6a33f [2025-02-06 09:24:44,378 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:24:44,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-02-06 09:24:44,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4f53ca76/f14663e4f8fc455ab47c1f2057dca05b/FLAGb9df6a33f [2025-02-06 09:24:44,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4f53ca76/f14663e4f8fc455ab47c1f2057dca05b [2025-02-06 09:24:44,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:24:44,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:24:44,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:24:44,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:24:44,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:24:44,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:24:44" (1/1) ... [2025-02-06 09:24:44,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e79b34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:44, skipping insertion in model container [2025-02-06 09:24:44,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:24:44" (1/1) ... [2025-02-06 09:24:44,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:24:44,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:24:44,969 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:24:44,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:24:45,023 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:24:45,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45 WrapperNode [2025-02-06 09:24:45,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:24:45,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:24:45,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:24:45,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:24:45,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,052 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2025-02-06 09:24:45,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:24:45,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:24:45,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:24:45,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:24:45,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:24:45,078 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:24:45,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:24:45,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:24:45,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (1/1) ... [2025-02-06 09:24:45,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:24:45,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:24:45,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:24:45,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:24:45,142 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:24:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:24:45,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:24:45,143 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:24:45,250 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:24:45,252 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:24:45,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:24:45,441 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:24:45,477 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:24:45,478 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:24:45,499 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:24:45,499 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:24:45,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:24:45 BoogieIcfgContainer [2025-02-06 09:24:45,500 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:24:45,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:24:45,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:24:45,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:24:45,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:24:44" (1/3) ... [2025-02-06 09:24:45,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8a4d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:24:45, skipping insertion in model container [2025-02-06 09:24:45,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:45" (2/3) ... [2025-02-06 09:24:45,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8a4d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:24:45, skipping insertion in model container [2025-02-06 09:24:45,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:24:45" (3/3) ... [2025-02-06 09:24:45,506 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2025-02-06 09:24:45,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:24:45,518 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_02-simple_racefree.i that has 2 procedures, 187 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-02-06 09:24:45,518 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:24:45,560 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:24:45,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 198 transitions, 403 flow [2025-02-06 09:24:45,648 INFO L124 PetriNetUnfolderBase]: 15/256 cut-off events. [2025-02-06 09:24:45,650 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:24:45,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 256 events. 15/256 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 648 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 140. Up to 4 conditions per place. [2025-02-06 09:24:45,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 198 transitions, 403 flow [2025-02-06 09:24:45,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 198 transitions, 403 flow [2025-02-06 09:24:45,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:24:45,671 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;@3e05e863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:24:45,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 09:24:45,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:24:45,689 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-06 09:24:45,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:24:45,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:45,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:45,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:45,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1273135641, now seen corresponding path program 1 times [2025-02-06 09:24:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606473573] [2025-02-06 09:24:45,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:45,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 09:24:45,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 09:24:45,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:45,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606473573] [2025-02-06 09:24:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606473573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:45,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:24:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495623700] [2025-02-06 09:24:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:45,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:45,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:45,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:45,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:46,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 198 [2025-02-06 09:24:46,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:46,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:46,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 198 [2025-02-06 09:24:46,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:46,110 INFO L124 PetriNetUnfolderBase]: 48/559 cut-off events. [2025-02-06 09:24:46,110 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:24:46,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 559 events. 48/559 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2361 event pairs, 35 based on Foata normal form. 81/587 useless extension candidates. Maximal degree in co-relation 553. Up to 108 conditions per place. [2025-02-06 09:24:46,114 INFO L140 encePairwiseOnDemand]: 185/198 looper letters, 22 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2025-02-06 09:24:46,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 192 transitions, 439 flow [2025-02-06 09:24:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2025-02-06 09:24:46,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2025-02-06 09:24:46,125 INFO L175 Difference]: Start difference. First operand has 190 places, 198 transitions, 403 flow. Second operand 3 states and 548 transitions. [2025-02-06 09:24:46,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 192 transitions, 439 flow [2025-02-06 09:24:46,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 192 transitions, 439 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:24:46,132 INFO L231 Difference]: Finished difference. Result has 191 places, 186 transitions, 387 flow [2025-02-06 09:24:46,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=186} [2025-02-06 09:24:46,136 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places. [2025-02-06 09:24:46,137 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 186 transitions, 387 flow [2025-02-06 09:24:46,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:46,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:46,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:46,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:24:46,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:46,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2103073923, now seen corresponding path program 1 times [2025-02-06 09:24:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:46,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348956639] [2025-02-06 09:24:46,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:46,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:24:46,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:24:46,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:46,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:46,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:46,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348956639] [2025-02-06 09:24:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348956639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700512365] [2025-02-06 09:24:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:46,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:46,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:46,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 198 [2025-02-06 09:24:46,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 186 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:46,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:46,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 198 [2025-02-06 09:24:46,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:47,002 INFO L124 PetriNetUnfolderBase]: 108/743 cut-off events. [2025-02-06 09:24:47,002 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 09:24:47,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 743 events. 108/743 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4024 event pairs, 31 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 884. Up to 181 conditions per place. [2025-02-06 09:24:47,009 INFO L140 encePairwiseOnDemand]: 192/198 looper letters, 48 selfloop transitions, 5 changer transitions 0/209 dead transitions. [2025-02-06 09:24:47,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 209 transitions, 539 flow [2025-02-06 09:24:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:24:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:24:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 996 transitions. [2025-02-06 09:24:47,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8383838383838383 [2025-02-06 09:24:47,017 INFO L175 Difference]: Start difference. First operand has 191 places, 186 transitions, 387 flow. Second operand 6 states and 996 transitions. [2025-02-06 09:24:47,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 209 transitions, 539 flow [2025-02-06 09:24:47,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 209 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:24:47,024 INFO L231 Difference]: Finished difference. Result has 193 places, 185 transitions, 391 flow [2025-02-06 09:24:47,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=193, PETRI_TRANSITIONS=185} [2025-02-06 09:24:47,025 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 3 predicate places. [2025-02-06 09:24:47,025 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 185 transitions, 391 flow [2025-02-06 09:24:47,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:47,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:47,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:47,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:24:47,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:47,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1066436245, now seen corresponding path program 1 times [2025-02-06 09:24:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:47,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108364864] [2025-02-06 09:24:47,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:47,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:24:47,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:24:47,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:47,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:47,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:47,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108364864] [2025-02-06 09:24:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108364864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:47,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:24:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752574900] [2025-02-06 09:24:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:47,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:47,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:47,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:47,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:47,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 198 [2025-02-06 09:24:47,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 185 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:47,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:47,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 198 [2025-02-06 09:24:47,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:47,279 INFO L124 PetriNetUnfolderBase]: 91/856 cut-off events. [2025-02-06 09:24:47,280 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:24:47,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 856 events. 91/856 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4771 event pairs, 30 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 973. Up to 125 conditions per place. [2025-02-06 09:24:47,285 INFO L140 encePairwiseOnDemand]: 189/198 looper letters, 30 selfloop transitions, 6 changer transitions 0/198 dead transitions. [2025-02-06 09:24:47,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 198 transitions, 492 flow [2025-02-06 09:24:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2025-02-06 09:24:47,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8939393939393939 [2025-02-06 09:24:47,287 INFO L175 Difference]: Start difference. First operand has 193 places, 185 transitions, 391 flow. Second operand 3 states and 531 transitions. [2025-02-06 09:24:47,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 198 transitions, 492 flow [2025-02-06 09:24:47,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 198 transitions, 482 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:24:47,294 INFO L231 Difference]: Finished difference. Result has 190 places, 187 transitions, 419 flow [2025-02-06 09:24:47,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=190, PETRI_TRANSITIONS=187} [2025-02-06 09:24:47,295 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 0 predicate places. [2025-02-06 09:24:47,295 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 187 transitions, 419 flow [2025-02-06 09:24:47,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:47,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:47,296 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:47,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:24:47,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:47,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1596906910, now seen corresponding path program 1 times [2025-02-06 09:24:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576644927] [2025-02-06 09:24:47,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:47,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:24:47,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:24:47,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:47,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:47,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:24:47,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:24:47,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:24:47,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:47,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:47,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:24:47,390 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:24:47,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-06 09:24:47,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-06 09:24:47,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-06 09:24:47,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-06 09:24:47,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-06 09:24:47,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-06 09:24:47,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-02-06 09:24:47,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-06 09:24:47,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-06 09:24:47,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-06 09:24:47,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-06 09:24:47,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-06 09:24:47,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:24:47,394 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:24:47,395 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:24:47,396 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:24:47,426 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:24:47,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 249 transitions, 514 flow [2025-02-06 09:24:47,476 INFO L124 PetriNetUnfolderBase]: 27/392 cut-off events. [2025-02-06 09:24:47,477 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:24:47,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 392 events. 27/392 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1230 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 258. Up to 6 conditions per place. [2025-02-06 09:24:47,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 249 transitions, 514 flow [2025-02-06 09:24:47,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 249 transitions, 514 flow [2025-02-06 09:24:47,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:24:47,486 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;@3e05e863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:24:47,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 09:24:47,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:24:47,496 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-06 09:24:47,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:24:47,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:47,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:47,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2044561984, now seen corresponding path program 1 times [2025-02-06 09:24:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415755540] [2025-02-06 09:24:47,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:47,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 09:24:47,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 09:24:47,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:47,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:47,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:47,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415755540] [2025-02-06 09:24:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415755540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:47,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:24:47,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663058636] [2025-02-06 09:24:47,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:47,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:47,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:47,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:47,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:47,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 249 [2025-02-06 09:24:47,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 249 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:47,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:47,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 249 [2025-02-06 09:24:47,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:48,121 INFO L124 PetriNetUnfolderBase]: 788/4501 cut-off events. [2025-02-06 09:24:48,121 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 09:24:48,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5854 conditions, 4501 events. 788/4501 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 42797 event pairs, 348 based on Foata normal form. 1025/5140 useless extension candidates. Maximal degree in co-relation 744. Up to 1303 conditions per place. [2025-02-06 09:24:48,139 INFO L140 encePairwiseOnDemand]: 230/249 looper letters, 31 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-02-06 09:24:48,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 238 transitions, 558 flow [2025-02-06 09:24:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2025-02-06 09:24:48,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022757697456493 [2025-02-06 09:24:48,141 INFO L175 Difference]: Start difference. First operand has 236 places, 249 transitions, 514 flow. Second operand 3 states and 674 transitions. [2025-02-06 09:24:48,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 238 transitions, 558 flow [2025-02-06 09:24:48,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 238 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:24:48,144 INFO L231 Difference]: Finished difference. Result has 237 places, 232 transitions, 490 flow [2025-02-06 09:24:48,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=237, PETRI_TRANSITIONS=232} [2025-02-06 09:24:48,145 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 1 predicate places. [2025-02-06 09:24:48,145 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 232 transitions, 490 flow [2025-02-06 09:24:48,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:48,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:48,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:48,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:24:48,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:48,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1961304893, now seen corresponding path program 1 times [2025-02-06 09:24:48,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:48,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731784786] [2025-02-06 09:24:48,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:48,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:48,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:24:48,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:24:48,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:48,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731784786] [2025-02-06 09:24:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731784786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:48,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:48,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63647333] [2025-02-06 09:24:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:48,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:48,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:48,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:48,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 249 [2025-02-06 09:24:48,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 232 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:48,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:48,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 249 [2025-02-06 09:24:48,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:49,281 INFO L124 PetriNetUnfolderBase]: 1718/5830 cut-off events. [2025-02-06 09:24:49,282 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-02-06 09:24:49,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 5830 events. 1718/5830 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 55086 event pairs, 222 based on Foata normal form. 0/5438 useless extension candidates. Maximal degree in co-relation 1247. Up to 2015 conditions per place. [2025-02-06 09:24:49,304 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 80 selfloop transitions, 6 changer transitions 0/279 dead transitions. [2025-02-06 09:24:49,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 279 transitions, 756 flow [2025-02-06 09:24:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:24:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:24:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1250 transitions. [2025-02-06 09:24:49,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8366800535475234 [2025-02-06 09:24:49,307 INFO L175 Difference]: Start difference. First operand has 237 places, 232 transitions, 490 flow. Second operand 6 states and 1250 transitions. [2025-02-06 09:24:49,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 279 transitions, 756 flow [2025-02-06 09:24:49,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 279 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:24:49,310 INFO L231 Difference]: Finished difference. Result has 240 places, 231 transitions, 498 flow [2025-02-06 09:24:49,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=240, PETRI_TRANSITIONS=231} [2025-02-06 09:24:49,311 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 4 predicate places. [2025-02-06 09:24:49,311 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 231 transitions, 498 flow [2025-02-06 09:24:49,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:49,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:49,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:49,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:24:49,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:49,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash -36189980, now seen corresponding path program 1 times [2025-02-06 09:24:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781410722] [2025-02-06 09:24:49,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:49,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:24:49,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:24:49,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:49,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781410722] [2025-02-06 09:24:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781410722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:24:49,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043887761] [2025-02-06 09:24:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:49,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:49,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:49,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:49,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 249 [2025-02-06 09:24:49,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 231 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:49,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:49,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 249 [2025-02-06 09:24:49,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:50,772 INFO L124 PetriNetUnfolderBase]: 3895/14780 cut-off events. [2025-02-06 09:24:50,774 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-02-06 09:24:50,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21338 conditions, 14780 events. 3895/14780 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 165586 event pairs, 1409 based on Foata normal form. 0/13252 useless extension candidates. Maximal degree in co-relation 14719. Up to 3516 conditions per place. [2025-02-06 09:24:50,833 INFO L140 encePairwiseOnDemand]: 230/249 looper letters, 58 selfloop transitions, 14 changer transitions 0/264 dead transitions. [2025-02-06 09:24:50,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 264 transitions, 719 flow [2025-02-06 09:24:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-02-06 09:24:50,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781793842034806 [2025-02-06 09:24:50,835 INFO L175 Difference]: Start difference. First operand has 240 places, 231 transitions, 498 flow. Second operand 3 states and 656 transitions. [2025-02-06 09:24:50,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 264 transitions, 719 flow [2025-02-06 09:24:50,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 264 transitions, 707 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:24:50,840 INFO L231 Difference]: Finished difference. Result has 239 places, 245 transitions, 608 flow [2025-02-06 09:24:50,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=239, PETRI_TRANSITIONS=245} [2025-02-06 09:24:50,842 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 3 predicate places. [2025-02-06 09:24:50,843 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 245 transitions, 608 flow [2025-02-06 09:24:50,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:50,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:50,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:50,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:24:50,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:50,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash 91676487, now seen corresponding path program 1 times [2025-02-06 09:24:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:50,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035090913] [2025-02-06 09:24:50,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:50,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:24:50,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:24:50,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:50,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:50,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:50,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035090913] [2025-02-06 09:24:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035090913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:50,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:50,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:24:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083311172] [2025-02-06 09:24:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:50,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:50,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:50,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:50,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 249 [2025-02-06 09:24:50,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 245 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:50,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:50,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 249 [2025-02-06 09:24:50,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:52,580 INFO L124 PetriNetUnfolderBase]: 4045/16817 cut-off events. [2025-02-06 09:24:52,581 INFO L125 PetriNetUnfolderBase]: For 4377/4554 co-relation queries the response was YES. [2025-02-06 09:24:52,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27572 conditions, 16817 events. 4045/16817 cut-off events. For 4377/4554 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 198340 event pairs, 2517 based on Foata normal form. 46/15316 useless extension candidates. Maximal degree in co-relation 26225. Up to 5540 conditions per place. [2025-02-06 09:24:52,655 INFO L140 encePairwiseOnDemand]: 240/249 looper letters, 52 selfloop transitions, 14 changer transitions 0/269 dead transitions. [2025-02-06 09:24:52,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 269 transitions, 826 flow [2025-02-06 09:24:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-02-06 09:24:52,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8701472556894244 [2025-02-06 09:24:52,657 INFO L175 Difference]: Start difference. First operand has 239 places, 245 transitions, 608 flow. Second operand 3 states and 650 transitions. [2025-02-06 09:24:52,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 269 transitions, 826 flow [2025-02-06 09:24:52,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 269 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:24:52,668 INFO L231 Difference]: Finished difference. Result has 241 places, 257 transitions, 706 flow [2025-02-06 09:24:52,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=241, PETRI_TRANSITIONS=257} [2025-02-06 09:24:52,669 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 5 predicate places. [2025-02-06 09:24:52,669 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 257 transitions, 706 flow [2025-02-06 09:24:52,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:52,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:52,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:52,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:24:52,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:52,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 61185166, now seen corresponding path program 1 times [2025-02-06 09:24:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:52,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390019293] [2025-02-06 09:24:52,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:52,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 09:24:52,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 09:24:52,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:52,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:24:52,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:52,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390019293] [2025-02-06 09:24:52,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390019293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:52,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:52,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:52,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451121350] [2025-02-06 09:24:52,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:52,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:24:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:52,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:24:52,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:24:52,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2025-02-06 09:24:52,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 257 transitions, 706 flow. Second operand has 5 states, 5 states have (on average 206.4) internal successors, (1032), 5 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:52,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:52,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2025-02-06 09:24:52,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:54,405 INFO L124 PetriNetUnfolderBase]: 3102/18287 cut-off events. [2025-02-06 09:24:54,405 INFO L125 PetriNetUnfolderBase]: For 1482/1828 co-relation queries the response was YES. [2025-02-06 09:24:54,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26015 conditions, 18287 events. 3102/18287 cut-off events. For 1482/1828 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 237583 event pairs, 1339 based on Foata normal form. 18/16298 useless extension candidates. Maximal degree in co-relation 11754. Up to 3769 conditions per place. [2025-02-06 09:24:54,475 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 56 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-02-06 09:24:54,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 289 transitions, 892 flow [2025-02-06 09:24:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:24:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:24:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1286 transitions. [2025-02-06 09:24:54,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8607764390896921 [2025-02-06 09:24:54,482 INFO L175 Difference]: Start difference. First operand has 241 places, 257 transitions, 706 flow. Second operand 6 states and 1286 transitions. [2025-02-06 09:24:54,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 289 transitions, 892 flow [2025-02-06 09:24:54,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 289 transitions, 864 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:24:54,489 INFO L231 Difference]: Finished difference. Result has 247 places, 259 transitions, 704 flow [2025-02-06 09:24:54,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=247, PETRI_TRANSITIONS=259} [2025-02-06 09:24:54,490 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 11 predicate places. [2025-02-06 09:24:54,490 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 259 transitions, 704 flow [2025-02-06 09:24:54,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 206.4) internal successors, (1032), 5 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:54,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:54,491 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:54,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:24:54,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:54,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash -876627993, now seen corresponding path program 1 times [2025-02-06 09:24:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:54,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519396794] [2025-02-06 09:24:54,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:54,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 09:24:54,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 09:24:54,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:54,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:54,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:24:54,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 09:24:54,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 09:24:54,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:54,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:24:54,541 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:24:54,541 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-06 09:24:54,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-06 09:24:54,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-06 09:24:54,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-06 09:24:54,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-06 09:24:54,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-06 09:24:54,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-06 09:24:54,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-06 09:24:54,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:24:54,543 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:24:54,544 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:24:54,544 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:24:54,568 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:24:54,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 300 transitions, 627 flow [2025-02-06 09:24:54,611 INFO L124 PetriNetUnfolderBase]: 42/571 cut-off events. [2025-02-06 09:24:54,611 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:24:54,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 571 events. 42/571 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2057 event pairs, 1 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 400. Up to 12 conditions per place. [2025-02-06 09:24:54,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 300 transitions, 627 flow [2025-02-06 09:24:54,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 300 transitions, 627 flow [2025-02-06 09:24:54,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:24:54,620 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;@3e05e863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:24:54,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-06 09:24:54,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:24:54,624 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-06 09:24:54,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:24:54,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:54,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:54,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:24:54,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1902060524, now seen corresponding path program 1 times [2025-02-06 09:24:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:54,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354102581] [2025-02-06 09:24:54,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:54,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:54,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 09:24:54,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 09:24:54,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:54,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354102581] [2025-02-06 09:24:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354102581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:54,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:54,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:24:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268255402] [2025-02-06 09:24:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:54,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:54,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:54,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:54,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:54,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 300 [2025-02-06 09:24:54,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 300 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:54,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:54,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 300 [2025-02-06 09:24:54,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:58,319 INFO L124 PetriNetUnfolderBase]: 8948/36657 cut-off events. [2025-02-06 09:24:58,319 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2025-02-06 09:24:58,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49895 conditions, 36657 events. 8948/36657 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 478829 event pairs, 8324 based on Foata normal form. 10522/43734 useless extension candidates. Maximal degree in co-relation 36489. Up to 12802 conditions per place. [2025-02-06 09:24:58,544 INFO L140 encePairwiseOnDemand]: 275/300 looper letters, 39 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-02-06 09:24:58,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 283 transitions, 675 flow [2025-02-06 09:24:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2025-02-06 09:24:58,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8877777777777778 [2025-02-06 09:24:58,547 INFO L175 Difference]: Start difference. First operand has 282 places, 300 transitions, 627 flow. Second operand 3 states and 799 transitions. [2025-02-06 09:24:58,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 283 transitions, 675 flow [2025-02-06 09:24:58,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 283 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:24:58,550 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 591 flow [2025-02-06 09:24:58,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2025-02-06 09:24:58,551 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 1 predicate places. [2025-02-06 09:24:58,552 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 591 flow [2025-02-06 09:24:58,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:58,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:58,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:58,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:24:58,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:24:58,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1838727229, now seen corresponding path program 1 times [2025-02-06 09:24:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:58,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952708093] [2025-02-06 09:24:58,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:58,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:24:58,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:24:58,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:58,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:58,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952708093] [2025-02-06 09:24:58,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952708093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:58,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:58,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:58,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787142109] [2025-02-06 09:24:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:58,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:58,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:58,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:58,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:59,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 300 [2025-02-06 09:24:59,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 591 flow. Second operand has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:59,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:59,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 300 [2025-02-06 09:24:59,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:05,768 INFO L124 PetriNetUnfolderBase]: 19590/67084 cut-off events. [2025-02-06 09:25:05,768 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2025-02-06 09:25:06,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96009 conditions, 67084 events. 19590/67084 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 912308 event pairs, 7382 based on Foata normal form. 0/61473 useless extension candidates. Maximal degree in co-relation 82585. Up to 20118 conditions per place. [2025-02-06 09:25:06,349 INFO L140 encePairwiseOnDemand]: 294/300 looper letters, 112 selfloop transitions, 6 changer transitions 0/348 dead transitions. [2025-02-06 09:25:06,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 348 transitions, 969 flow [2025-02-06 09:25:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-02-06 09:25:06,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355555555555556 [2025-02-06 09:25:06,352 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 591 flow. Second operand 6 states and 1504 transitions. [2025-02-06 09:25:06,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 348 transitions, 969 flow [2025-02-06 09:25:06,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 348 transitions, 967 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:06,358 INFO L231 Difference]: Finished difference. Result has 286 places, 276 transitions, 599 flow [2025-02-06 09:25:06,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=599, PETRI_PLACES=286, PETRI_TRANSITIONS=276} [2025-02-06 09:25:06,359 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 4 predicate places. [2025-02-06 09:25:06,359 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 276 transitions, 599 flow [2025-02-06 09:25:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:06,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:06,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:06,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:25:06,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:25:06,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash -717416523, now seen corresponding path program 1 times [2025-02-06 09:25:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:06,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292677692] [2025-02-06 09:25:06,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:06,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:25:06,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:25:06,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:06,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:06,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:06,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292677692] [2025-02-06 09:25:06,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292677692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:06,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:06,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845371426] [2025-02-06 09:25:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:06,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:06,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:06,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:06,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 300 [2025-02-06 09:25:06,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 276 transitions, 599 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:06,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:06,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 300 [2025-02-06 09:25:06,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand