./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/twostage_3-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/pthread/twostage_3-race.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 c1c75e051173a22f60f33f26eab32e0b3a7dcaf46f2d4cc494d0c9d8775c984e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:03:32,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:03:32,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:03:32,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:03:32,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:03:32,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:03:32,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:03:32,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:03:32,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:03:32,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:03:32,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:03:32,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:03:32,804 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:03:32,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:03:32,805 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:03:32,806 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:03:32,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:03:32,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:03:32,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:03:32,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:03:32,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:03:32,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:03:32,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:32,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:03:32,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:32,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:03:32,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:03:32,807 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 -> c1c75e051173a22f60f33f26eab32e0b3a7dcaf46f2d4cc494d0c9d8775c984e [2025-01-09 21:03:33,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:03:33,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:03:33,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:03:33,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:03:33,050 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:03:33,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/twostage_3-race.i [2025-01-09 21:03:34,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a40d1c126/357d4f45c6bc4e33ae7deeaa2f44202e/FLAG599e66bab [2025-01-09 21:03:34,550 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:03:34,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3-race.i [2025-01-09 21:03:34,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a40d1c126/357d4f45c6bc4e33ae7deeaa2f44202e/FLAG599e66bab [2025-01-09 21:03:34,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a40d1c126/357d4f45c6bc4e33ae7deeaa2f44202e [2025-01-09 21:03:34,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:03:34,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:03:34,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:03:34,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:03:34,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:03:34,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:34" (1/1) ... [2025-01-09 21:03:34,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75123ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:34, skipping insertion in model container [2025-01-09 21:03:34,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:34" (1/1) ... [2025-01-09 21:03:34,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:03:34,916 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-09 21:03:34,917 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-09 21:03:34,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:03:34,925 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:03:34,981 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-09 21:03:34,982 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-09 21:03:34,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:03:35,029 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:03:35,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35 WrapperNode [2025-01-09 21:03:35,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:03:35,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:03:35,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:03:35,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:03:35,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,076 INFO L138 Inliner]: procedures = 373, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 272 [2025-01-09 21:03:35,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:03:35,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:03:35,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:03:35,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:03:35,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,091 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:03:35,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:03:35,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:03:35,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:03:35,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:35,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:03:35,123 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-01-09 21:03:35,128 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-01-09 21:03:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-01-09 21:03:35,141 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-01-09 21:03:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-01-09 21:03:35,141 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-01-09 21:03:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:03:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:03:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:03:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:03:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:03:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:03:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:03:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:03:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:03:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:03:35,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:03:35,143 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:03:35,237 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:03:35,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:03:35,589 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:03:35,589 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:03:35,622 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:03:35,624 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:03:35,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:35 BoogieIcfgContainer [2025-01-09 21:03:35,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:03:35,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:03:35,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:03:35,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:03:35,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:03:34" (1/3) ... [2025-01-09 21:03:35,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300e8bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:35, skipping insertion in model container [2025-01-09 21:03:35,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (2/3) ... [2025-01-09 21:03:35,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300e8bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:35, skipping insertion in model container [2025-01-09 21:03:35,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:35" (3/3) ... [2025-01-09 21:03:35,632 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3-race.i [2025-01-09 21:03:35,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:03:35,644 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3-race.i that has 3 procedures, 335 locations, 1 initial locations, 4 loop locations, and 43 error locations. [2025-01-09 21:03:35,644 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:03:35,716 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:03:35,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 357 transitions, 734 flow [2025-01-09 21:03:35,865 INFO L124 PetriNetUnfolderBase]: 43/670 cut-off events. [2025-01-09 21:03:35,868 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:03:35,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 670 events. 43/670 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2840 event pairs, 0 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 354. Up to 8 conditions per place. [2025-01-09 21:03:35,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 357 transitions, 734 flow [2025-01-09 21:03:35,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 341 places, 357 transitions, 734 flow [2025-01-09 21:03:35,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:03:35,899 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;@33ccf00d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:03:35,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-01-09 21:03:35,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:03:35,903 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:03:35,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:03:35,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:35,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:35,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:35,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash -273341926, now seen corresponding path program 1 times [2025-01-09 21:03:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:35,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594519465] [2025-01-09 21:03:35,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:35,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:03:35,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:03:35,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:36,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594519465] [2025-01-09 21:03:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594519465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:36,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813052879] [2025-01-09 21:03:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:36,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:36,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:36,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:36,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-01-09 21:03:36,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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-01-09 21:03:36,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:36,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-01-09 21:03:36,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:36,419 INFO L124 PetriNetUnfolderBase]: 197/2060 cut-off events. [2025-01-09 21:03:36,419 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-01-09 21:03:36,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 2060 events. 197/2060 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 15293 event pairs, 166 based on Foata normal form. 186/1888 useless extension candidates. Maximal degree in co-relation 1786. Up to 338 conditions per place. [2025-01-09 21:03:36,434 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 23 selfloop transitions, 1 changer transitions 8/337 dead transitions. [2025-01-09 21:03:36,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 337 transitions, 742 flow [2025-01-09 21:03:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2025-01-09 21:03:36,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2025-01-09 21:03:36,454 INFO L175 Difference]: Start difference. First operand has 341 places, 357 transitions, 734 flow. Second operand 3 states and 984 transitions. [2025-01-09 21:03:36,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 337 transitions, 742 flow [2025-01-09 21:03:36,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 337 transitions, 742 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:03:36,466 INFO L231 Difference]: Finished difference. Result has 337 places, 329 transitions, 680 flow [2025-01-09 21:03:36,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=337, PETRI_TRANSITIONS=329} [2025-01-09 21:03:36,471 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -4 predicate places. [2025-01-09 21:03:36,471 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 329 transitions, 680 flow [2025-01-09 21:03:36,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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-01-09 21:03:36,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:36,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:36,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:03:36,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:36,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:36,474 INFO L85 PathProgramCache]: Analyzing trace with hash 116298917, now seen corresponding path program 1 times [2025-01-09 21:03:36,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:36,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19308029] [2025-01-09 21:03:36,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:36,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:36,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:03:36,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:03:36,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:36,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19308029] [2025-01-09 21:03:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19308029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678184319] [2025-01-09 21:03:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:36,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:36,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:36,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 357 [2025-01-09 21:03:36,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 329 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:36,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:36,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 357 [2025-01-09 21:03:36,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:36,869 INFO L124 PetriNetUnfolderBase]: 120/2428 cut-off events. [2025-01-09 21:03:36,870 INFO L125 PetriNetUnfolderBase]: For 182/242 co-relation queries the response was YES. [2025-01-09 21:03:36,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 2428 events. 120/2428 cut-off events. For 182/242 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 18401 event pairs, 84 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 1341. Up to 113 conditions per place. [2025-01-09 21:03:36,882 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 31 selfloop transitions, 1 changer transitions 0/343 dead transitions. [2025-01-09 21:03:36,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 343 transitions, 790 flow [2025-01-09 21:03:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2025-01-09 21:03:36,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2025-01-09 21:03:36,885 INFO L175 Difference]: Start difference. First operand has 337 places, 329 transitions, 680 flow. Second operand 3 states and 1005 transitions. [2025-01-09 21:03:36,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 343 transitions, 790 flow [2025-01-09 21:03:36,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 343 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:36,889 INFO L231 Difference]: Finished difference. Result has 329 places, 328 transitions, 679 flow [2025-01-09 21:03:36,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=329, PETRI_TRANSITIONS=328} [2025-01-09 21:03:36,890 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -12 predicate places. [2025-01-09 21:03:36,890 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 328 transitions, 679 flow [2025-01-09 21:03:36,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:36,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:36,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:36,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:03:36,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:36,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:36,891 INFO L85 PathProgramCache]: Analyzing trace with hash -689977061, now seen corresponding path program 1 times [2025-01-09 21:03:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:36,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340025458] [2025-01-09 21:03:36,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:36,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:03:36,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:03:36,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:36,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:36,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340025458] [2025-01-09 21:03:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340025458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:36,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:36,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508482420] [2025-01-09 21:03:36,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:36,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:36,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:36,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:36,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:36,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 357 [2025-01-09 21:03:36,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 328 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 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-01-09 21:03:36,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:36,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 357 [2025-01-09 21:03:36,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:37,332 INFO L124 PetriNetUnfolderBase]: 544/3303 cut-off events. [2025-01-09 21:03:37,333 INFO L125 PetriNetUnfolderBase]: For 206/266 co-relation queries the response was YES. [2025-01-09 21:03:37,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 3303 events. 544/3303 cut-off events. For 206/266 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 27125 event pairs, 116 based on Foata normal form. 5/2897 useless extension candidates. Maximal degree in co-relation 2202. Up to 785 conditions per place. [2025-01-09 21:03:37,355 INFO L140 encePairwiseOnDemand]: 341/357 looper letters, 33 selfloop transitions, 5 changer transitions 11/335 dead transitions. [2025-01-09 21:03:37,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 335 transitions, 785 flow [2025-01-09 21:03:37,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-01-09 21:03:37,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.896358543417367 [2025-01-09 21:03:37,361 INFO L175 Difference]: Start difference. First operand has 329 places, 328 transitions, 679 flow. Second operand 3 states and 960 transitions. [2025-01-09 21:03:37,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 335 transitions, 785 flow [2025-01-09 21:03:37,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 335 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:37,366 INFO L231 Difference]: Finished difference. Result has 323 places, 313 transitions, 667 flow [2025-01-09 21:03:37,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=323, PETRI_TRANSITIONS=313} [2025-01-09 21:03:37,367 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -18 predicate places. [2025-01-09 21:03:37,367 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 313 transitions, 667 flow [2025-01-09 21:03:37,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 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-01-09 21:03:37,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:37,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:37,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:03:37,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:37,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -283365252, now seen corresponding path program 1 times [2025-01-09 21:03:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:37,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126119077] [2025-01-09 21:03:37,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:37,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:03:37,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:03:37,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:37,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:37,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126119077] [2025-01-09 21:03:37,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126119077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:37,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:37,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971856568] [2025-01-09 21:03:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:37,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:37,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:37,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:37,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:37,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-01-09 21:03:37,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 313 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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-01-09 21:03:37,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:37,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-01-09 21:03:37,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:37,842 INFO L124 PetriNetUnfolderBase]: 644/5442 cut-off events. [2025-01-09 21:03:37,843 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-09 21:03:37,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6763 conditions, 5442 events. 644/5442 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 52931 event pairs, 548 based on Foata normal form. 0/4586 useless extension candidates. Maximal degree in co-relation 6140. Up to 1038 conditions per place. [2025-01-09 21:03:37,869 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-01-09 21:03:37,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 711 flow [2025-01-09 21:03:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-01-09 21:03:37,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066293183940243 [2025-01-09 21:03:37,872 INFO L175 Difference]: Start difference. First operand has 323 places, 313 transitions, 667 flow. Second operand 3 states and 971 transitions. [2025-01-09 21:03:37,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 711 flow [2025-01-09 21:03:37,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 310 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:03:37,876 INFO L231 Difference]: Finished difference. Result has 313 places, 310 transitions, 669 flow [2025-01-09 21:03:37,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=313, PETRI_TRANSITIONS=310} [2025-01-09 21:03:37,877 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -28 predicate places. [2025-01-09 21:03:37,877 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 669 flow [2025-01-09 21:03:37,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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-01-09 21:03:37,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:37,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:37,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:03:37,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:37,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash -207012381, now seen corresponding path program 1 times [2025-01-09 21:03:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083839254] [2025-01-09 21:03:37,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:37,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:03:37,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:03:37,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:37,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:37,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:37,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083839254] [2025-01-09 21:03:37,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083839254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:37,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:37,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:37,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494857799] [2025-01-09 21:03:37,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:37,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:37,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:37,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:37,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:37,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 357 [2025-01-09 21:03:37,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 310 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-01-09 21:03:37,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:37,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 357 [2025-01-09 21:03:37,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:38,353 INFO L124 PetriNetUnfolderBase]: 396/3957 cut-off events. [2025-01-09 21:03:38,354 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-09 21:03:38,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 3957 events. 396/3957 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 36297 event pairs, 324 based on Foata normal form. 0/3350 useless extension candidates. Maximal degree in co-relation 4413. Up to 666 conditions per place. [2025-01-09 21:03:38,377 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-01-09 21:03:38,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 717 flow [2025-01-09 21:03:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2025-01-09 21:03:38,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094304388422035 [2025-01-09 21:03:38,416 INFO L175 Difference]: Start difference. First operand has 313 places, 310 transitions, 669 flow. Second operand 3 states and 974 transitions. [2025-01-09 21:03:38,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 717 flow [2025-01-09 21:03:38,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 309 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:03:38,420 INFO L231 Difference]: Finished difference. Result has 314 places, 309 transitions, 671 flow [2025-01-09 21:03:38,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=314, PETRI_TRANSITIONS=309} [2025-01-09 21:03:38,420 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -27 predicate places. [2025-01-09 21:03:38,421 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 309 transitions, 671 flow [2025-01-09 21:03:38,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-01-09 21:03:38,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:38,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:38,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:03:38,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:38,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash 742163168, now seen corresponding path program 1 times [2025-01-09 21:03:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023882349] [2025-01-09 21:03:38,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:38,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:38,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:03:38,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:03:38,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:38,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:38,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023882349] [2025-01-09 21:03:38,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023882349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:38,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:38,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:03:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469571086] [2025-01-09 21:03:38,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:38,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:38,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:38,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:38,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:38,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 357 [2025-01-09 21:03:38,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 309 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 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-01-09 21:03:38,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:38,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 357 [2025-01-09 21:03:38,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:38,715 INFO L124 PetriNetUnfolderBase]: 260/3163 cut-off events. [2025-01-09 21:03:38,715 INFO L125 PetriNetUnfolderBase]: For 182/242 co-relation queries the response was YES. [2025-01-09 21:03:38,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 3163 events. 260/3163 cut-off events. For 182/242 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 27376 event pairs, 200 based on Foata normal form. 2/2672 useless extension candidates. Maximal degree in co-relation 3465. Up to 444 conditions per place. [2025-01-09 21:03:38,727 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 22 selfloop transitions, 0 changer transitions 1/308 dead transitions. [2025-01-09 21:03:38,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 308 transitions, 712 flow [2025-01-09 21:03:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-01-09 21:03:38,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103641456582633 [2025-01-09 21:03:38,729 INFO L175 Difference]: Start difference. First operand has 314 places, 309 transitions, 671 flow. Second operand 3 states and 975 transitions. [2025-01-09 21:03:38,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 308 transitions, 712 flow [2025-01-09 21:03:38,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 308 transitions, 704 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-09 21:03:38,735 INFO L231 Difference]: Finished difference. Result has 313 places, 307 transitions, 658 flow [2025-01-09 21:03:38,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=313, PETRI_TRANSITIONS=307} [2025-01-09 21:03:38,736 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -28 predicate places. [2025-01-09 21:03:38,736 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 307 transitions, 658 flow [2025-01-09 21:03:38,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 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-01-09 21:03:38,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:38,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:38,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:03:38,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:38,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1004995681, now seen corresponding path program 1 times [2025-01-09 21:03:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:38,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826929763] [2025-01-09 21:03:38,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:38,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:03:38,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:03:38,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:38,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:38,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:38,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826929763] [2025-01-09 21:03:38,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826929763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:38,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:38,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:38,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795774415] [2025-01-09 21:03:38,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:38,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:38,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:38,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:38,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 357 [2025-01-09 21:03:38,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 307 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:38,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:38,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 357 [2025-01-09 21:03:38,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:39,024 INFO L124 PetriNetUnfolderBase]: 122/2376 cut-off events. [2025-01-09 21:03:39,024 INFO L125 PetriNetUnfolderBase]: For 182/242 co-relation queries the response was YES. [2025-01-09 21:03:39,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 2376 events. 122/2376 cut-off events. For 182/242 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17895 event pairs, 84 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 2787. Up to 113 conditions per place. [2025-01-09 21:03:39,033 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 31 selfloop transitions, 1 changer transitions 0/321 dead transitions. [2025-01-09 21:03:39,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 321 transitions, 768 flow [2025-01-09 21:03:39,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2025-01-09 21:03:39,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2025-01-09 21:03:39,035 INFO L175 Difference]: Start difference. First operand has 313 places, 307 transitions, 658 flow. Second operand 3 states and 1005 transitions. [2025-01-09 21:03:39,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 321 transitions, 768 flow [2025-01-09 21:03:39,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 321 transitions, 766 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:39,039 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 656 flow [2025-01-09 21:03:39,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-01-09 21:03:39,040 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-01-09 21:03:39,040 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 656 flow [2025-01-09 21:03:39,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:39,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:39,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:03:39,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:39,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:39,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1314580538, now seen corresponding path program 1 times [2025-01-09 21:03:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:39,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598777619] [2025-01-09 21:03:39,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:39,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:03:39,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:03:39,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:39,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598777619] [2025-01-09 21:03:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598777619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:39,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074758771] [2025-01-09 21:03:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:39,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:39,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:39,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-01-09 21:03:39,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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-01-09 21:03:39,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:39,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-01-09 21:03:39,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:39,490 INFO L124 PetriNetUnfolderBase]: 488/4220 cut-off events. [2025-01-09 21:03:39,491 INFO L125 PetriNetUnfolderBase]: For 246/390 co-relation queries the response was YES. [2025-01-09 21:03:39,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 4220 events. 488/4220 cut-off events. For 246/390 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 39670 event pairs, 412 based on Foata normal form. 0/3508 useless extension candidates. Maximal degree in co-relation 5323. Up to 830 conditions per place. [2025-01-09 21:03:39,511 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 25 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-01-09 21:03:39,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 305 transitions, 708 flow [2025-01-09 21:03:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-01-09 21:03:39,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2025-01-09 21:03:39,513 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 656 flow. Second operand 3 states and 970 transitions. [2025-01-09 21:03:39,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 305 transitions, 708 flow [2025-01-09 21:03:39,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 305 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:39,518 INFO L231 Difference]: Finished difference. Result has 312 places, 305 transitions, 657 flow [2025-01-09 21:03:39,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=312, PETRI_TRANSITIONS=305} [2025-01-09 21:03:39,518 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-01-09 21:03:39,518 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 305 transitions, 657 flow [2025-01-09 21:03:39,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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-01-09 21:03:39,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:39,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:39,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:03:39,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:39,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1235531822, now seen corresponding path program 1 times [2025-01-09 21:03:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767233067] [2025-01-09 21:03:39,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:39,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:03:39,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:03:39,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:39,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:39,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767233067] [2025-01-09 21:03:39,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767233067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:39,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:39,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654449641] [2025-01-09 21:03:39,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:39,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:39,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:39,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:39,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 357 [2025-01-09 21:03:39,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 305 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-01-09 21:03:39,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:39,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 357 [2025-01-09 21:03:39,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:39,991 INFO L124 PetriNetUnfolderBase]: 514/4563 cut-off events. [2025-01-09 21:03:39,991 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-09 21:03:39,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5667 conditions, 4563 events. 514/4563 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 43568 event pairs, 432 based on Foata normal form. 0/3846 useless extension candidates. Maximal degree in co-relation 5660. Up to 836 conditions per place. [2025-01-09 21:03:40,005 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-01-09 21:03:40,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 304 transitions, 705 flow [2025-01-09 21:03:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2025-01-09 21:03:40,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094304388422035 [2025-01-09 21:03:40,007 INFO L175 Difference]: Start difference. First operand has 312 places, 305 transitions, 657 flow. Second operand 3 states and 974 transitions. [2025-01-09 21:03:40,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 304 transitions, 705 flow [2025-01-09 21:03:40,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 304 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:40,010 INFO L231 Difference]: Finished difference. Result has 311 places, 304 transitions, 655 flow [2025-01-09 21:03:40,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=311, PETRI_TRANSITIONS=304} [2025-01-09 21:03:40,011 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -30 predicate places. [2025-01-09 21:03:40,011 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 304 transitions, 655 flow [2025-01-09 21:03:40,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-01-09 21:03:40,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:40,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:40,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:03:40,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:40,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2013121820, now seen corresponding path program 1 times [2025-01-09 21:03:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73253602] [2025-01-09 21:03:40,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:40,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:40,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:03:40,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:03:40,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:40,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73253602] [2025-01-09 21:03:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73253602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:40,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531272274] [2025-01-09 21:03:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:40,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:40,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:40,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:40,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 357 [2025-01-09 21:03:40,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 304 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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-01-09 21:03:40,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:40,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 357 [2025-01-09 21:03:40,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:40,329 INFO L124 PetriNetUnfolderBase]: 440/3867 cut-off events. [2025-01-09 21:03:40,330 INFO L125 PetriNetUnfolderBase]: For 234/310 co-relation queries the response was YES. [2025-01-09 21:03:40,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4885 conditions, 3867 events. 440/3867 cut-off events. For 234/310 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 35680 event pairs, 368 based on Foata normal form. 0/3282 useless extension candidates. Maximal degree in co-relation 4878. Up to 748 conditions per place. [2025-01-09 21:03:40,350 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 24 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-01-09 21:03:40,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 303 transitions, 705 flow [2025-01-09 21:03:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2025-01-09 21:03:40,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907563025210084 [2025-01-09 21:03:40,352 INFO L175 Difference]: Start difference. First operand has 311 places, 304 transitions, 655 flow. Second operand 3 states and 972 transitions. [2025-01-09 21:03:40,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 303 transitions, 705 flow [2025-01-09 21:03:40,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 303 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:40,355 INFO L231 Difference]: Finished difference. Result has 310 places, 303 transitions, 653 flow [2025-01-09 21:03:40,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=310, PETRI_TRANSITIONS=303} [2025-01-09 21:03:40,356 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-01-09 21:03:40,356 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 303 transitions, 653 flow [2025-01-09 21:03:40,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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-01-09 21:03:40,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:40,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:40,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:03:40,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:40,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2059468113, now seen corresponding path program 1 times [2025-01-09 21:03:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:40,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080325910] [2025-01-09 21:03:40,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:40,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:40,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:03:40,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:03:40,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:40,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:40,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:40,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080325910] [2025-01-09 21:03:40,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080325910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:40,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:40,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358790737] [2025-01-09 21:03:40,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:40,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:40,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:40,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:40,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 357 [2025-01-09 21:03:40,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 303 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 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-01-09 21:03:40,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:40,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 357 [2025-01-09 21:03:40,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:40,689 INFO L124 PetriNetUnfolderBase]: 362/4085 cut-off events. [2025-01-09 21:03:40,689 INFO L125 PetriNetUnfolderBase]: For 322/1314 co-relation queries the response was YES. [2025-01-09 21:03:40,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5110 conditions, 4085 events. 362/4085 cut-off events. For 322/1314 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 37835 event pairs, 268 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 5103. Up to 630 conditions per place. [2025-01-09 21:03:40,709 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 27 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2025-01-09 21:03:40,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 297 transitions, 697 flow [2025-01-09 21:03:40,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-01-09 21:03:40,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944911297852475 [2025-01-09 21:03:40,711 INFO L175 Difference]: Start difference. First operand has 310 places, 303 transitions, 653 flow. Second operand 3 states and 958 transitions. [2025-01-09 21:03:40,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 297 transitions, 697 flow [2025-01-09 21:03:40,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 297 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:40,714 INFO L231 Difference]: Finished difference. Result has 304 places, 297 transitions, 639 flow [2025-01-09 21:03:40,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=304, PETRI_TRANSITIONS=297} [2025-01-09 21:03:40,715 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -37 predicate places. [2025-01-09 21:03:40,715 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 297 transitions, 639 flow [2025-01-09 21:03:40,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 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-01-09 21:03:40,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:40,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:40,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:03:40,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:40,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1415706165, now seen corresponding path program 1 times [2025-01-09 21:03:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:40,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066979902] [2025-01-09 21:03:40,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:40,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:03:40,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:03:40,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:40,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:40,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:40,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066979902] [2025-01-09 21:03:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066979902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494608173] [2025-01-09 21:03:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:40,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:40,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:40,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:40,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 357 [2025-01-09 21:03:40,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 297 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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-01-09 21:03:40,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:40,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 357 [2025-01-09 21:03:40,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:41,002 INFO L124 PetriNetUnfolderBase]: 322/3123 cut-off events. [2025-01-09 21:03:41,003 INFO L125 PetriNetUnfolderBase]: For 394/494 co-relation queries the response was YES. [2025-01-09 21:03:41,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 3123 events. 322/3123 cut-off events. For 394/494 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 26005 event pairs, 228 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 4059. Up to 574 conditions per place. [2025-01-09 21:03:41,018 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 25 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2025-01-09 21:03:41,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 292 transitions, 681 flow [2025-01-09 21:03:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-01-09 21:03:41,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900093370681606 [2025-01-09 21:03:41,024 INFO L175 Difference]: Start difference. First operand has 304 places, 297 transitions, 639 flow. Second operand 3 states and 964 transitions. [2025-01-09 21:03:41,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 292 transitions, 681 flow [2025-01-09 21:03:41,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 292 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:41,028 INFO L231 Difference]: Finished difference. Result has 300 places, 292 transitions, 630 flow [2025-01-09 21:03:41,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=300, PETRI_TRANSITIONS=292} [2025-01-09 21:03:41,028 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -41 predicate places. [2025-01-09 21:03:41,028 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 292 transitions, 630 flow [2025-01-09 21:03:41,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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-01-09 21:03:41,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:41,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:03:41,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:41,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1857550961, now seen corresponding path program 1 times [2025-01-09 21:03:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867687154] [2025-01-09 21:03:41,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:41,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:03:41,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:03:41,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:41,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:41,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:41,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867687154] [2025-01-09 21:03:41,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867687154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:41,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:41,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:03:41,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867280842] [2025-01-09 21:03:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:41,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:03:41,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:41,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:03:41,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:03:41,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 357 [2025-01-09 21:03:41,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 292 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 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-01-09 21:03:41,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:41,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 357 [2025-01-09 21:03:41,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:42,544 INFO L124 PetriNetUnfolderBase]: 2566/14595 cut-off events. [2025-01-09 21:03:42,544 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-01-09 21:03:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19374 conditions, 14595 events. 2566/14595 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 177286 event pairs, 1956 based on Foata normal form. 0/13188 useless extension candidates. Maximal degree in co-relation 19367. Up to 3973 conditions per place. [2025-01-09 21:03:42,599 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 59 selfloop transitions, 6 changer transitions 0/307 dead transitions. [2025-01-09 21:03:42,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 790 flow [2025-01-09 21:03:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:03:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:03:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1818 transitions. [2025-01-09 21:03:42,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487394957983193 [2025-01-09 21:03:42,602 INFO L175 Difference]: Start difference. First operand has 300 places, 292 transitions, 630 flow. Second operand 6 states and 1818 transitions. [2025-01-09 21:03:42,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 790 flow [2025-01-09 21:03:42,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 307 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:42,607 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 639 flow [2025-01-09 21:03:42,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2025-01-09 21:03:42,608 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -38 predicate places. [2025-01-09 21:03:42,608 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 639 flow [2025-01-09 21:03:42,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 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-01-09 21:03:42,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:42,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:42,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:03:42,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash 293861445, now seen corresponding path program 1 times [2025-01-09 21:03:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237058463] [2025-01-09 21:03:42,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:42,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:03:42,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:03:42,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:42,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:42,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237058463] [2025-01-09 21:03:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237058463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:42,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:03:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043872071] [2025-01-09 21:03:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:42,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:03:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:42,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:03:42,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:03:42,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 357 [2025-01-09 21:03:42,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 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-01-09 21:03:42,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:42,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 357 [2025-01-09 21:03:42,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,204 INFO L124 PetriNetUnfolderBase]: 610/4941 cut-off events. [2025-01-09 21:03:43,204 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-01-09 21:03:43,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6270 conditions, 4941 events. 610/4941 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 47136 event pairs, 437 based on Foata normal form. 36/4494 useless extension candidates. Maximal degree in co-relation 6263. Up to 673 conditions per place. [2025-01-09 21:03:43,224 INFO L140 encePairwiseOnDemand]: 344/357 looper letters, 58 selfloop transitions, 11 changer transitions 1/331 dead transitions. [2025-01-09 21:03:43,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 331 transitions, 883 flow [2025-01-09 21:03:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:03:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:03:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1320 transitions. [2025-01-09 21:03:43,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243697478991597 [2025-01-09 21:03:43,228 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 639 flow. Second operand 4 states and 1320 transitions. [2025-01-09 21:03:43,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 331 transitions, 883 flow [2025-01-09 21:03:43,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 331 transitions, 871 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:03:43,232 INFO L231 Difference]: Finished difference. Result has 303 places, 300 transitions, 709 flow [2025-01-09 21:03:43,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=709, PETRI_PLACES=303, PETRI_TRANSITIONS=300} [2025-01-09 21:03:43,234 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -38 predicate places. [2025-01-09 21:03:43,234 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 300 transitions, 709 flow [2025-01-09 21:03:43,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 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-01-09 21:03:43,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:43,235 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] [2025-01-09 21:03:43,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:03:43,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting funcAErr1ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash -323001577, now seen corresponding path program 1 times [2025-01-09 21:03:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:43,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455445123] [2025-01-09 21:03:43,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:03:43,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:03:43,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:43,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:43,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455445123] [2025-01-09 21:03:43,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455445123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272759534] [2025-01-09 21:03:43,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:43,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:43,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 357 [2025-01-09 21:03:43,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 300 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-01-09 21:03:43,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 357 [2025-01-09 21:03:43,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,579 INFO L124 PetriNetUnfolderBase]: 268/2934 cut-off events. [2025-01-09 21:03:43,579 INFO L125 PetriNetUnfolderBase]: For 275/530 co-relation queries the response was YES. [2025-01-09 21:03:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 2934 events. 268/2934 cut-off events. For 275/530 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24387 event pairs, 166 based on Foata normal form. 0/2662 useless extension candidates. Maximal degree in co-relation 3888. Up to 443 conditions per place. [2025-01-09 21:03:43,593 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 30 selfloop transitions, 5 changer transitions 0/312 dead transitions. [2025-01-09 21:03:43,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 312 transitions, 812 flow [2025-01-09 21:03:43,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-01-09 21:03:43,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927170868347339 [2025-01-09 21:03:43,595 INFO L175 Difference]: Start difference. First operand has 303 places, 300 transitions, 709 flow. Second operand 3 states and 993 transitions. [2025-01-09 21:03:43,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 312 transitions, 812 flow [2025-01-09 21:03:43,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 312 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:43,599 INFO L231 Difference]: Finished difference. Result has 306 places, 304 transitions, 745 flow [2025-01-09 21:03:43,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=306, PETRI_TRANSITIONS=304} [2025-01-09 21:03:43,600 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -35 predicate places. [2025-01-09 21:03:43,600 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 304 transitions, 745 flow [2025-01-09 21:03:43,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-01-09 21:03:43,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:43,600 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-01-09 21:03:43,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:03:43,601 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting funcAErr4ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:43,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:43,601 INFO L85 PathProgramCache]: Analyzing trace with hash 347194073, now seen corresponding path program 1 times [2025-01-09 21:03:43,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:43,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163573007] [2025-01-09 21:03:43,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:03:43,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:03:43,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:43,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:43,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163573007] [2025-01-09 21:03:43,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163573007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556806442] [2025-01-09 21:03:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:43,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:43,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 357 [2025-01-09 21:03:43,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 304 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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-01-09 21:03:43,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 357 [2025-01-09 21:03:43,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:44,005 INFO L124 PetriNetUnfolderBase]: 355/4187 cut-off events. [2025-01-09 21:03:44,005 INFO L125 PetriNetUnfolderBase]: For 488/1056 co-relation queries the response was YES. [2025-01-09 21:03:44,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 4187 events. 355/4187 cut-off events. For 488/1056 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 40746 event pairs, 93 based on Foata normal form. 2/3860 useless extension candidates. Maximal degree in co-relation 5676. Up to 507 conditions per place. [2025-01-09 21:03:44,031 INFO L140 encePairwiseOnDemand]: 348/357 looper letters, 36 selfloop transitions, 8 changer transitions 0/321 dead transitions. [2025-01-09 21:03:44,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 321 transitions, 888 flow [2025-01-09 21:03:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2025-01-09 21:03:44,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9290382819794585 [2025-01-09 21:03:44,033 INFO L175 Difference]: Start difference. First operand has 306 places, 304 transitions, 745 flow. Second operand 3 states and 995 transitions. [2025-01-09 21:03:44,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 321 transitions, 888 flow [2025-01-09 21:03:44,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 321 transitions, 874 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:44,039 INFO L231 Difference]: Finished difference. Result has 307 places, 310 transitions, 805 flow [2025-01-09 21:03:44,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=307, PETRI_TRANSITIONS=310} [2025-01-09 21:03:44,039 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -34 predicate places. [2025-01-09 21:03:44,040 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 805 flow [2025-01-09 21:03:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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-01-09 21:03:44,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:44,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:44,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:03:44,041 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:03:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 62987466, now seen corresponding path program 1 times [2025-01-09 21:03:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978596547] [2025-01-09 21:03:44,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:44,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:03:44,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:03:44,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:44,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:03:44,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:03:44,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:03:44,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:03:44,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:44,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:03:44,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:03:44,111 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:03:44,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 61 remaining) [2025-01-09 21:03:44,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-01-09 21:03:44,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-01-09 21:03:44,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-01-09 21:03:44,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-01-09 21:03:44,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-01-09 21:03:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (24 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (23 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (22 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-01-09 21:03:44,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-01-09 21:03:44,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-01-09 21:03:44,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:03:44,117 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:44,119 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:03:44,119 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:03:44,153 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-09 21:03:44,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 458 transitions, 960 flow [2025-01-09 21:03:44,355 INFO L124 PetriNetUnfolderBase]: 163/1958 cut-off events. [2025-01-09 21:03:44,355 INFO L125 PetriNetUnfolderBase]: For 72/74 co-relation queries the response was YES. [2025-01-09 21:03:44,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1958 events. 163/1958 cut-off events. For 72/74 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 12305 event pairs, 1 based on Foata normal form. 0/1599 useless extension candidates. Maximal degree in co-relation 1163. Up to 32 conditions per place. [2025-01-09 21:03:44,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 439 places, 458 transitions, 960 flow [2025-01-09 21:03:44,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 458 transitions, 960 flow [2025-01-09 21:03:44,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:03:44,388 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;@33ccf00d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:03:44,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-01-09 21:03:44,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:03:44,389 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:03:44,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:03:44,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:44,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:44,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-01-09 21:03:44,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1187026462, now seen corresponding path program 1 times [2025-01-09 21:03:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662948664] [2025-01-09 21:03:44,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:44,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:03:44,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:03:44,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:44,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:44,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:44,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662948664] [2025-01-09 21:03:44,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662948664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:44,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:44,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109050719] [2025-01-09 21:03:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:44,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:44,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:44,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:44,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 458 [2025-01-09 21:03:44,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 458 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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-01-09 21:03:44,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:44,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 458 [2025-01-09 21:03:44,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:54,270 INFO L124 PetriNetUnfolderBase]: 18400/85864 cut-off events. [2025-01-09 21:03:54,271 INFO L125 PetriNetUnfolderBase]: For 7767/7767 co-relation queries the response was YES. [2025-01-09 21:03:54,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113081 conditions, 85864 events. 18400/85864 cut-off events. For 7767/7767 co-relation queries the response was YES. Maximal size of possible extension queue 1659. Compared 1310774 event pairs, 16524 based on Foata normal form. 9795/81881 useless extension candidates. Maximal degree in co-relation 87518. Up to 24187 conditions per place. [2025-01-09 21:03:55,275 INFO L140 encePairwiseOnDemand]: 437/458 looper letters, 38 selfloop transitions, 1 changer transitions 8/434 dead transitions. [2025-01-09 21:03:55,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 434 transitions, 990 flow [2025-01-09 21:03:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2025-01-09 21:03:55,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9097525473071325 [2025-01-09 21:03:55,277 INFO L175 Difference]: Start difference. First operand has 439 places, 458 transitions, 960 flow. Second operand 3 states and 1250 transitions. [2025-01-09 21:03:55,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 434 transitions, 990 flow [2025-01-09 21:03:55,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 434 transitions, 990 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:03:55,293 INFO L231 Difference]: Finished difference. Result has 433 places, 426 transitions, 898 flow [2025-01-09 21:03:55,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=433, PETRI_TRANSITIONS=426} [2025-01-09 21:03:55,294 INFO L279 CegarLoopForPetriNet]: 439 programPoint places, -6 predicate places. [2025-01-09 21:03:55,294 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 426 transitions, 898 flow [2025-01-09 21:03:55,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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-01-09 21:03:55,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:55,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:55,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:03:55,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-01-09 21:03:55,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1856849829, now seen corresponding path program 1 times [2025-01-09 21:03:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048427729] [2025-01-09 21:03:55,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:55,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:03:55,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:03:55,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:55,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048427729] [2025-01-09 21:03:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048427729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:55,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37393508] [2025-01-09 21:03:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:55,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:55,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:55,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 458 [2025-01-09 21:03:55,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 426 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 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-01-09 21:03:55,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:55,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 458 [2025-01-09 21:03:55,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:07,971 INFO L124 PetriNetUnfolderBase]: 15480/93326 cut-off events. [2025-01-09 21:04:07,971 INFO L125 PetriNetUnfolderBase]: For 16224/17730 co-relation queries the response was YES. [2025-01-09 21:04:08,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120191 conditions, 93326 events. 15480/93326 cut-off events. For 16224/17730 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 1536825 event pairs, 13384 based on Foata normal form. 0/79189 useless extension candidates. Maximal degree in co-relation 60064. Up to 10394 conditions per place. [2025-01-09 21:04:09,432 INFO L140 encePairwiseOnDemand]: 456/458 looper letters, 61 selfloop transitions, 1 changer transitions 0/455 dead transitions. [2025-01-09 21:04:09,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 455 transitions, 1120 flow [2025-01-09 21:04:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2025-01-09 21:04:09,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344978165938864 [2025-01-09 21:04:09,434 INFO L175 Difference]: Start difference. First operand has 433 places, 426 transitions, 898 flow. Second operand 3 states and 1284 transitions. [2025-01-09 21:04:09,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 455 transitions, 1120 flow [2025-01-09 21:04:09,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 455 transitions, 1119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:09,476 INFO L231 Difference]: Finished difference. Result has 425 places, 425 transitions, 897 flow [2025-01-09 21:04:09,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=425, PETRI_TRANSITIONS=425} [2025-01-09 21:04:09,477 INFO L279 CegarLoopForPetriNet]: 439 programPoint places, -14 predicate places. [2025-01-09 21:04:09,477 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 425 transitions, 897 flow [2025-01-09 21:04:09,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 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-01-09 21:04:09,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:09,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:09,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:04:09,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-01-09 21:04:09,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1727494115, now seen corresponding path program 1 times [2025-01-09 21:04:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989146365] [2025-01-09 21:04:09,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:09,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:04:09,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:04:09,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:09,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:09,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:09,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989146365] [2025-01-09 21:04:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989146365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:09,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567160185] [2025-01-09 21:04:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:09,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:09,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:09,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:09,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 458 [2025-01-09 21:04:09,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 425 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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-01-09 21:04:09,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:09,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 458 [2025-01-09 21:04:09,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand