./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.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/goblint-regression/09-regions_22-nocollapse.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 a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:24:50,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:24:50,206 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:24:50,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:24:50,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:24:50,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:24:50,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:24:50,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:24:50,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:24:50,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:24:50,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:24:50,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:24:50,249 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:24:50,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:24:50,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:24:50,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:24:50,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:24:50,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:24:50,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:24:50,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:24:50,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:24:50,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:24:50,250 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:24:50,250 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:24:50,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:24:50,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:24:50,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:24:50,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:24:50,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:24:50,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:50,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:50,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:50,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:24:50,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:50,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:50,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:50,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:24:50,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:24:50,254 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 -> a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df [2025-01-09 21:24:50,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:24:50,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:24:50,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:24:50,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:24:50,558 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:24:50,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2025-01-09 21:24:51,914 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/922f7c97c/dc3f707d9d9140fe91a319143db8c8d4/FLAGf61118708 [2025-01-09 21:24:52,229 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:24:52,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2025-01-09 21:24:52,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/922f7c97c/dc3f707d9d9140fe91a319143db8c8d4/FLAGf61118708 [2025-01-09 21:24:52,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/922f7c97c/dc3f707d9d9140fe91a319143db8c8d4 [2025-01-09 21:24:52,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:24:52,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:24:52,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:52,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:24:52,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:24:52,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:52" (1/1) ... [2025-01-09 21:24:52,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:52, skipping insertion in model container [2025-01-09 21:24:52,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:52" (1/1) ... [2025-01-09 21:24:52,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:24:52,955 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:24:52,959 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:24:52,960 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:24:52,962 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:24:52,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:53,026 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:24:53,062 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:24:53,067 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:24:53,067 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:24:53,068 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:24:53,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:53,129 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:24:53,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53 WrapperNode [2025-01-09 21:24:53,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:53,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:53,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:24:53,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:24:53,138 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:24:53" (1/1) ... [2025-01-09 21:24:53,164 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:24:53" (1/1) ... [2025-01-09 21:24:53,196 INFO L138 Inliner]: procedures = 274, calls = 98, calls flagged for inlining = 9, calls inlined = 8, statements flattened = 270 [2025-01-09 21:24:53,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:53,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:24:53,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:24:53,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:24:53,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:24:53,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:24:53,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:24:53,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:24:53,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (1/1) ... [2025-01-09 21:24:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:53,286 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:24:53,289 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:24:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-01-09 21:24:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-01-09 21:24:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:24:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:24:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:24:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:24:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:24:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:24:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:24:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:24:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:24:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:24:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:24:53,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:24:53,315 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:24:53,448 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:24:53,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:24:53,962 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:24:53,962 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:24:53,994 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:24:53,994 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:24:53,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:53 BoogieIcfgContainer [2025-01-09 21:24:53,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:24:53,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:24:53,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:24:54,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:24:54,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:24:52" (1/3) ... [2025-01-09 21:24:54,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c65c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:54, skipping insertion in model container [2025-01-09 21:24:54,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:53" (2/3) ... [2025-01-09 21:24:54,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c65c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:54, skipping insertion in model container [2025-01-09 21:24:54,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:53" (3/3) ... [2025-01-09 21:24:54,004 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_22-nocollapse.i [2025-01-09 21:24:54,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:24:54,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_22-nocollapse.i that has 2 procedures, 305 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-01-09 21:24:54,020 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:24:54,144 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:24:54,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 379 transitions, 766 flow [2025-01-09 21:24:54,327 INFO L124 PetriNetUnfolderBase]: 9/377 cut-off events. [2025-01-09 21:24:54,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:54,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 377 events. 9/377 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 586 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 304. Up to 2 conditions per place. [2025-01-09 21:24:54,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 379 transitions, 766 flow [2025-01-09 21:24:54,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 760 flow [2025-01-09 21:24:54,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:24:54,376 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;@57fde85c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:24:54,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-09 21:24:54,398 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:24:54,399 INFO L124 PetriNetUnfolderBase]: 1/116 cut-off events. [2025-01-09 21:24:54,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:54,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:54,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:54,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:24:54,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1109636073, now seen corresponding path program 1 times [2025-01-09 21:24:54,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:54,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491265551] [2025-01-09 21:24:54,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:54,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:24:54,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:24:54,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:54,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:55,554 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:24:55,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:55,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491265551] [2025-01-09 21:24:55,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491265551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:55,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:55,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010100072] [2025-01-09 21:24:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:55,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:55,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:55,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:55,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:56,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 379 [2025-01-09 21:24:56,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 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:24:56,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:56,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 379 [2025-01-09 21:24:56,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:56,544 INFO L124 PetriNetUnfolderBase]: 449/1855 cut-off events. [2025-01-09 21:24:56,545 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:24:56,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 1855 events. 449/1855 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11539 event pairs, 342 based on Foata normal form. 35/1682 useless extension candidates. Maximal degree in co-relation 2477. Up to 846 conditions per place. [2025-01-09 21:24:56,565 INFO L140 encePairwiseOnDemand]: 364/379 looper letters, 72 selfloop transitions, 10 changer transitions 1/372 dead transitions. [2025-01-09 21:24:56,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 372 transitions, 914 flow [2025-01-09 21:24:56,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1839 transitions. [2025-01-09 21:24:56,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8087071240105541 [2025-01-09 21:24:56,588 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 760 flow. Second operand 6 states and 1839 transitions. [2025-01-09 21:24:56,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 372 transitions, 914 flow [2025-01-09 21:24:56,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 372 transitions, 912 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:24:56,602 INFO L231 Difference]: Finished difference. Result has 376 places, 371 transitions, 766 flow [2025-01-09 21:24:56,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=376, PETRI_TRANSITIONS=371} [2025-01-09 21:24:56,609 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 1 predicate places. [2025-01-09 21:24:56,611 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 371 transitions, 766 flow [2025-01-09 21:24:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 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:24:56,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:56,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:56,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:24:56,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:24:56,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash 525538993, now seen corresponding path program 1 times [2025-01-09 21:24:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:56,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161648761] [2025-01-09 21:24:56,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:56,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 21:24:56,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 21:24:56,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:56,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:57,187 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:24:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161648761] [2025-01-09 21:24:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161648761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:57,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:57,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:57,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050690943] [2025-01-09 21:24:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:57,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:57,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:57,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:57,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 379 [2025-01-09 21:24:57,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 371 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 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:24:57,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:57,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 379 [2025-01-09 21:24:57,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:58,165 INFO L124 PetriNetUnfolderBase]: 449/1852 cut-off events. [2025-01-09 21:24:58,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:58,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 1852 events. 449/1852 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11544 event pairs, 342 based on Foata normal form. 0/1647 useless extension candidates. Maximal degree in co-relation 2586. Up to 846 conditions per place. [2025-01-09 21:24:58,184 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 72 selfloop transitions, 10 changer transitions 0/369 dead transitions. [2025-01-09 21:24:58,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 369 transitions, 926 flow [2025-01-09 21:24:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1836 transitions. [2025-01-09 21:24:58,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8073878627968337 [2025-01-09 21:24:58,193 INFO L175 Difference]: Start difference. First operand has 376 places, 371 transitions, 766 flow. Second operand 6 states and 1836 transitions. [2025-01-09 21:24:58,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 369 transitions, 926 flow [2025-01-09 21:24:58,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 369 transitions, 906 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:58,203 INFO L231 Difference]: Finished difference. Result has 373 places, 369 transitions, 762 flow [2025-01-09 21:24:58,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=762, PETRI_PLACES=373, PETRI_TRANSITIONS=369} [2025-01-09 21:24:58,206 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-01-09 21:24:58,207 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 369 transitions, 762 flow [2025-01-09 21:24:58,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 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:24:58,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:58,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:58,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:24:58,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:24:58,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:58,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1307275089, now seen corresponding path program 1 times [2025-01-09 21:24:58,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:58,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60010678] [2025-01-09 21:24:58,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:58,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:24:58,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:24:58,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:58,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:58,324 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:24:58,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:58,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60010678] [2025-01-09 21:24:58,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60010678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:24:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097267256] [2025-01-09 21:24:58,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:58,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:24:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:58,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:24:58,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:24:58,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 379 [2025-01-09 21:24:58,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 369 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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:24:58,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:58,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 379 [2025-01-09 21:24:58,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:58,441 INFO L124 PetriNetUnfolderBase]: 29/671 cut-off events. [2025-01-09 21:24:58,442 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:58,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 671 events. 29/671 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2426 event pairs, 18 based on Foata normal form. 1/620 useless extension candidates. Maximal degree in co-relation 435. Up to 45 conditions per place. [2025-01-09 21:24:58,447 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-01-09 21:24:58,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 370 transitions, 790 flow [2025-01-09 21:24:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:24:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:24:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-01-09 21:24:58,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9727352682497801 [2025-01-09 21:24:58,451 INFO L175 Difference]: Start difference. First operand has 373 places, 369 transitions, 762 flow. Second operand 3 states and 1106 transitions. [2025-01-09 21:24:58,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 370 transitions, 790 flow [2025-01-09 21:24:58,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 770 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:58,460 INFO L231 Difference]: Finished difference. Result has 371 places, 370 transitions, 754 flow [2025-01-09 21:24:58,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=371, PETRI_TRANSITIONS=370} [2025-01-09 21:24:58,462 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -4 predicate places. [2025-01-09 21:24:58,462 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 370 transitions, 754 flow [2025-01-09 21:24:58,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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:24:58,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:58,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:58,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:24:58,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:24:58,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1203761901, now seen corresponding path program 1 times [2025-01-09 21:24:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401333407] [2025-01-09 21:24:58,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:58,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:58,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 21:24:58,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 21:24:58,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:58,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:59,082 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:24:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:59,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401333407] [2025-01-09 21:24:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401333407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:59,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:59,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:59,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874987936] [2025-01-09 21:24:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:59,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:59,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:59,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:59,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:59,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 379 [2025-01-09 21:24:59,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 370 transitions, 754 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:24:59,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:59,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 379 [2025-01-09 21:24:59,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:59,843 INFO L124 PetriNetUnfolderBase]: 450/1974 cut-off events. [2025-01-09 21:24:59,843 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:24:59,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2926 conditions, 1974 events. 450/1974 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12267 event pairs, 342 based on Foata normal form. 0/1765 useless extension candidates. Maximal degree in co-relation 2660. Up to 894 conditions per place. [2025-01-09 21:24:59,856 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 79 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-01-09 21:24:59,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 369 transitions, 920 flow [2025-01-09 21:24:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1831 transitions. [2025-01-09 21:24:59,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051890941072999 [2025-01-09 21:24:59,861 INFO L175 Difference]: Start difference. First operand has 371 places, 370 transitions, 754 flow. Second operand 6 states and 1831 transitions. [2025-01-09 21:24:59,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 369 transitions, 920 flow [2025-01-09 21:24:59,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 369 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:59,867 INFO L231 Difference]: Finished difference. Result has 374 places, 369 transitions, 760 flow [2025-01-09 21:24:59,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=374, PETRI_TRANSITIONS=369} [2025-01-09 21:24:59,868 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-01-09 21:24:59,868 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 369 transitions, 760 flow [2025-01-09 21:24:59,870 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:24:59,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:59,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:59,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:24:59,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:24:59,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1162901498, now seen corresponding path program 1 times [2025-01-09 21:24:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:59,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342032404] [2025-01-09 21:24:59,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:24:59,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:24:59,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:59,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342032404] [2025-01-09 21:24:59,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342032404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:59,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:59,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:24:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152020633] [2025-01-09 21:24:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:59,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:24:59,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:59,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:24:59,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:24:59,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 379 [2025-01-09 21:24:59,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 369 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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:24:59,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:59,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 379 [2025-01-09 21:24:59,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:00,100 INFO L124 PetriNetUnfolderBase]: 29/857 cut-off events. [2025-01-09 21:25:00,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:00,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 857 events. 29/857 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2423 event pairs, 18 based on Foata normal form. 2/801 useless extension candidates. Maximal degree in co-relation 513. Up to 49 conditions per place. [2025-01-09 21:25:00,105 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-01-09 21:25:00,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 370 transitions, 788 flow [2025-01-09 21:25:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-01-09 21:25:00,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9727352682497801 [2025-01-09 21:25:00,108 INFO L175 Difference]: Start difference. First operand has 374 places, 369 transitions, 760 flow. Second operand 3 states and 1106 transitions. [2025-01-09 21:25:00,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 370 transitions, 788 flow [2025-01-09 21:25:00,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 370 transitions, 778 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:00,113 INFO L231 Difference]: Finished difference. Result has 372 places, 370 transitions, 762 flow [2025-01-09 21:25:00,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=372, PETRI_TRANSITIONS=370} [2025-01-09 21:25:00,114 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-01-09 21:25:00,114 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 370 transitions, 762 flow [2025-01-09 21:25:00,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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:25:00,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:00,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:00,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:25:00,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:00,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1307632750, now seen corresponding path program 1 times [2025-01-09 21:25:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494555193] [2025-01-09 21:25:00,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:00,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:25:00,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:25:00,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:00,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:00,714 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:25:00,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494555193] [2025-01-09 21:25:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494555193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:00,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276867985] [2025-01-09 21:25:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:00,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:00,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:00,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:01,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-01-09 21:25:01,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 370 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 320.5) internal successors, (1923), 6 states have internal predecessors, (1923), 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:25:01,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:01,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-01-09 21:25:01,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:01,430 INFO L124 PetriNetUnfolderBase]: 75/1169 cut-off events. [2025-01-09 21:25:01,431 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:25:01,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 1169 events. 75/1169 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4542 event pairs, 42 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 953. Up to 263 conditions per place. [2025-01-09 21:25:01,437 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 54 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-01-09 21:25:01,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 369 transitions, 878 flow [2025-01-09 21:25:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1956 transitions. [2025-01-09 21:25:01,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8601583113456465 [2025-01-09 21:25:01,459 INFO L175 Difference]: Start difference. First operand has 372 places, 370 transitions, 762 flow. Second operand 6 states and 1956 transitions. [2025-01-09 21:25:01,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 369 transitions, 878 flow [2025-01-09 21:25:01,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 369 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:01,469 INFO L231 Difference]: Finished difference. Result has 375 places, 369 transitions, 768 flow [2025-01-09 21:25:01,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=768, PETRI_PLACES=375, PETRI_TRANSITIONS=369} [2025-01-09 21:25:01,470 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 0 predicate places. [2025-01-09 21:25:01,471 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 369 transitions, 768 flow [2025-01-09 21:25:01,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.5) internal successors, (1923), 6 states have internal predecessors, (1923), 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:25:01,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:01,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:25:01,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:01,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1975749053, now seen corresponding path program 1 times [2025-01-09 21:25:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:01,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746168482] [2025-01-09 21:25:01,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:01,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 21:25:01,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 21:25:01,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:01,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:02,058 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:25:02,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746168482] [2025-01-09 21:25:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746168482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:02,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:02,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059278007] [2025-01-09 21:25:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:02,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:02,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:02,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:02,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:02,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 379 [2025-01-09 21:25:02,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 369 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 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:25:02,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:02,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 379 [2025-01-09 21:25:02,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:02,844 INFO L124 PetriNetUnfolderBase]: 450/2154 cut-off events. [2025-01-09 21:25:02,844 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:02,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 2154 events. 450/2154 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12233 event pairs, 342 based on Foata normal form. 0/1945 useless extension candidates. Maximal degree in co-relation 2703. Up to 960 conditions per place. [2025-01-09 21:25:02,856 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 79 selfloop transitions, 5 changer transitions 0/368 dead transitions. [2025-01-09 21:25:02,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 368 transitions, 934 flow [2025-01-09 21:25:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1831 transitions. [2025-01-09 21:25:02,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051890941072999 [2025-01-09 21:25:02,861 INFO L175 Difference]: Start difference. First operand has 375 places, 369 transitions, 768 flow. Second operand 6 states and 1831 transitions. [2025-01-09 21:25:02,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 368 transitions, 934 flow [2025-01-09 21:25:02,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 368 transitions, 924 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:02,866 INFO L231 Difference]: Finished difference. Result has 374 places, 368 transitions, 766 flow [2025-01-09 21:25:02,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=374, PETRI_TRANSITIONS=368} [2025-01-09 21:25:02,867 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-01-09 21:25:02,867 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 368 transitions, 766 flow [2025-01-09 21:25:02,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 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:25:02,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:02,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:02,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:25:02,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2046350812, now seen corresponding path program 1 times [2025-01-09 21:25:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:02,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001146097] [2025-01-09 21:25:02,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:02,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 21:25:02,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 21:25:02,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:02,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:03,411 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:25:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001146097] [2025-01-09 21:25:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001146097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284146935] [2025-01-09 21:25:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:03,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:03,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:03,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:03,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 379 [2025-01-09 21:25:03,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 368 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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:25:03,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:03,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 379 [2025-01-09 21:25:03,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:04,110 INFO L124 PetriNetUnfolderBase]: 450/2150 cut-off events. [2025-01-09 21:25:04,110 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:04,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 2150 events. 450/2150 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12225 event pairs, 342 based on Foata normal form. 0/1945 useless extension candidates. Maximal degree in co-relation 2719. Up to 944 conditions per place. [2025-01-09 21:25:04,123 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 75 selfloop transitions, 5 changer transitions 0/367 dead transitions. [2025-01-09 21:25:04,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 367 transitions, 924 flow [2025-01-09 21:25:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1851 transitions. [2025-01-09 21:25:04,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139841688654353 [2025-01-09 21:25:04,128 INFO L175 Difference]: Start difference. First operand has 374 places, 368 transitions, 766 flow. Second operand 6 states and 1851 transitions. [2025-01-09 21:25:04,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 367 transitions, 924 flow [2025-01-09 21:25:04,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 367 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:04,133 INFO L231 Difference]: Finished difference. Result has 373 places, 367 transitions, 764 flow [2025-01-09 21:25:04,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=373, PETRI_TRANSITIONS=367} [2025-01-09 21:25:04,135 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-01-09 21:25:04,135 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 367 transitions, 764 flow [2025-01-09 21:25:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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:25:04,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:04,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:04,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:25:04,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:04,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:04,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1823949523, now seen corresponding path program 1 times [2025-01-09 21:25:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126171113] [2025-01-09 21:25:04,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:04,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 21:25:04,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 21:25:04,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:04,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:25:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126171113] [2025-01-09 21:25:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126171113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061083342] [2025-01-09 21:25:04,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:04,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:04,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:04,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:05,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 379 [2025-01-09 21:25:05,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 367 transitions, 764 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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:25:05,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:05,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 379 [2025-01-09 21:25:05,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:05,388 INFO L124 PetriNetUnfolderBase]: 450/2146 cut-off events. [2025-01-09 21:25:05,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:05,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3186 conditions, 2146 events. 450/2146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12252 event pairs, 342 based on Foata normal form. 0/1945 useless extension candidates. Maximal degree in co-relation 2734. Up to 944 conditions per place. [2025-01-09 21:25:05,405 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 75 selfloop transitions, 5 changer transitions 0/366 dead transitions. [2025-01-09 21:25:05,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 366 transitions, 922 flow [2025-01-09 21:25:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1851 transitions. [2025-01-09 21:25:05,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139841688654353 [2025-01-09 21:25:05,410 INFO L175 Difference]: Start difference. First operand has 373 places, 367 transitions, 764 flow. Second operand 6 states and 1851 transitions. [2025-01-09 21:25:05,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 366 transitions, 922 flow [2025-01-09 21:25:05,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 366 transitions, 912 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:05,459 INFO L231 Difference]: Finished difference. Result has 372 places, 366 transitions, 762 flow [2025-01-09 21:25:05,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=762, PETRI_PLACES=372, PETRI_TRANSITIONS=366} [2025-01-09 21:25:05,460 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-01-09 21:25:05,461 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 366 transitions, 762 flow [2025-01-09 21:25:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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:25:05,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:05,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:05,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:25:05,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:05,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash -104221844, now seen corresponding path program 1 times [2025-01-09 21:25:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761413316] [2025-01-09 21:25:05,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:05,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 21:25:05,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 21:25:05,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:05,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:25:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761413316] [2025-01-09 21:25:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761413316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:06,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:06,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602693473] [2025-01-09 21:25:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:06,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:06,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:06,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:06,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 379 [2025-01-09 21:25:06,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 366 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 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:25:06,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:06,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 379 [2025-01-09 21:25:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:06,826 INFO L124 PetriNetUnfolderBase]: 450/2142 cut-off events. [2025-01-09 21:25:06,826 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:06,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 2142 events. 450/2142 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12207 event pairs, 342 based on Foata normal form. 0/1945 useless extension candidates. Maximal degree in co-relation 2747. Up to 964 conditions per place. [2025-01-09 21:25:06,838 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 80 selfloop transitions, 5 changer transitions 0/365 dead transitions. [2025-01-09 21:25:06,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 365 transitions, 930 flow [2025-01-09 21:25:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1826 transitions. [2025-01-09 21:25:06,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.802990325417766 [2025-01-09 21:25:06,844 INFO L175 Difference]: Start difference. First operand has 372 places, 366 transitions, 762 flow. Second operand 6 states and 1826 transitions. [2025-01-09 21:25:06,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 365 transitions, 930 flow [2025-01-09 21:25:06,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 365 transitions, 920 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:06,852 INFO L231 Difference]: Finished difference. Result has 371 places, 365 transitions, 760 flow [2025-01-09 21:25:06,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=371, PETRI_TRANSITIONS=365} [2025-01-09 21:25:06,853 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -4 predicate places. [2025-01-09 21:25:06,854 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 365 transitions, 760 flow [2025-01-09 21:25:06,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 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:25:06,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:06,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:06,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:25:06,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:06,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash -322713290, now seen corresponding path program 1 times [2025-01-09 21:25:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392790475] [2025-01-09 21:25:06,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:06,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 21:25:06,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 21:25:06,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:06,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:25:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392790475] [2025-01-09 21:25:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392790475] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218070520] [2025-01-09 21:25:07,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:07,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:07,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:07,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:07,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:25:07,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 21:25:07,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 21:25:07,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:07,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:07,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:25:07,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:25:07,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:25:07,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218070520] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:07,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:07,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:25:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748031967] [2025-01-09 21:25:07,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:07,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:25:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:07,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:25:07,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:25:07,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-01-09 21:25:07,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 365 transitions, 760 flow. Second operand has 10 states, 10 states have (on average 363.0) internal successors, (3630), 10 states have internal predecessors, (3630), 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:25:07,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:07,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-01-09 21:25:07,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:07,925 INFO L124 PetriNetUnfolderBase]: 29/1021 cut-off events. [2025-01-09 21:25:07,925 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:25:07,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 1021 events. 29/1021 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1815 event pairs, 18 based on Foata normal form. 4/987 useless extension candidates. Maximal degree in co-relation 506. Up to 49 conditions per place. [2025-01-09 21:25:07,928 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 15 selfloop transitions, 9 changer transitions 0/373 dead transitions. [2025-01-09 21:25:07,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 373 transitions, 826 flow [2025-01-09 21:25:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:25:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:25:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3275 transitions. [2025-01-09 21:25:07,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601289944297859 [2025-01-09 21:25:07,934 INFO L175 Difference]: Start difference. First operand has 371 places, 365 transitions, 760 flow. Second operand 9 states and 3275 transitions. [2025-01-09 21:25:07,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 373 transitions, 826 flow [2025-01-09 21:25:07,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 373 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:07,939 INFO L231 Difference]: Finished difference. Result has 377 places, 371 transitions, 800 flow [2025-01-09 21:25:07,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=800, PETRI_PLACES=377, PETRI_TRANSITIONS=371} [2025-01-09 21:25:07,940 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 2 predicate places. [2025-01-09 21:25:07,941 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 371 transitions, 800 flow [2025-01-09 21:25:07,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 363.0) internal successors, (3630), 10 states have internal predecessors, (3630), 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:25:07,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:07,942 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:07,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:25:08,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 21:25:08,143 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:08,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1360103530, now seen corresponding path program 2 times [2025-01-09 21:25:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:08,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815515723] [2025-01-09 21:25:08,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:08,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:08,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 420 statements into 2 equivalence classes. [2025-01-09 21:25:08,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 121 of 420 statements. [2025-01-09 21:25:08,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:08,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 21:25:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815515723] [2025-01-09 21:25:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815515723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:08,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:08,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063687247] [2025-01-09 21:25:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:08,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:08,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:08,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:09,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 379 [2025-01-09 21:25:09,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 371 transitions, 800 flow. Second operand has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 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:25:09,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:09,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 379 [2025-01-09 21:25:09,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:09,953 INFO L124 PetriNetUnfolderBase]: 199/1922 cut-off events. [2025-01-09 21:25:09,953 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:25:09,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 1922 events. 199/1922 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8794 event pairs, 54 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 1891. Up to 448 conditions per place. [2025-01-09 21:25:09,963 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 71 selfloop transitions, 23 changer transitions 0/406 dead transitions. [2025-01-09 21:25:09,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 406 transitions, 1066 flow [2025-01-09 21:25:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1997 transitions. [2025-01-09 21:25:09,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781882145998241 [2025-01-09 21:25:09,967 INFO L175 Difference]: Start difference. First operand has 377 places, 371 transitions, 800 flow. Second operand 6 states and 1997 transitions. [2025-01-09 21:25:09,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 406 transitions, 1066 flow [2025-01-09 21:25:09,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 406 transitions, 1060 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:09,974 INFO L231 Difference]: Finished difference. Result has 386 places, 393 transitions, 952 flow [2025-01-09 21:25:09,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=386, PETRI_TRANSITIONS=393} [2025-01-09 21:25:09,976 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 11 predicate places. [2025-01-09 21:25:09,976 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 393 transitions, 952 flow [2025-01-09 21:25:09,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 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:25:09,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:09,977 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:09,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:25:09,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:09,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1547324623, now seen corresponding path program 1 times [2025-01-09 21:25:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:09,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770288613] [2025-01-09 21:25:09,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:09,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:10,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 21:25:10,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 21:25:10,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:10,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-01-09 21:25:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770288613] [2025-01-09 21:25:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770288613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294526725] [2025-01-09 21:25:10,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:10,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:10,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:10,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:25:10,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 21:25:10,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 21:25:10,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:10,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:10,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:25:10,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 21:25:11,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 21:25:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294526725] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:11,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-09 21:25:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125546034] [2025-01-09 21:25:11,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 21:25:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:11,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 21:25:11,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 21:25:11,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 379 [2025-01-09 21:25:11,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 393 transitions, 952 flow. Second operand has 19 states, 19 states have (on average 357.6842105263158) internal successors, (6796), 19 states have internal predecessors, (6796), 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:25:11,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:11,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 379 [2025-01-09 21:25:11,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:13,278 INFO L124 PetriNetUnfolderBase]: 186/3460 cut-off events. [2025-01-09 21:25:13,278 INFO L125 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2025-01-09 21:25:13,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4184 conditions, 3460 events. 186/3460 cut-off events. For 134/138 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9486 event pairs, 55 based on Foata normal form. 13/3304 useless extension candidates. Maximal degree in co-relation 2868. Up to 146 conditions per place. [2025-01-09 21:25:13,286 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 47 selfloop transitions, 68 changer transitions 0/479 dead transitions. [2025-01-09 21:25:13,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 479 transitions, 1592 flow [2025-01-09 21:25:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 21:25:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-01-09 21:25:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 22493 transitions. [2025-01-09 21:25:13,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420362692130502 [2025-01-09 21:25:13,378 INFO L175 Difference]: Start difference. First operand has 386 places, 393 transitions, 952 flow. Second operand 63 states and 22493 transitions. [2025-01-09 21:25:13,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 479 transitions, 1592 flow [2025-01-09 21:25:13,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 479 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:25:13,387 INFO L231 Difference]: Finished difference. Result has 464 places, 455 transitions, 1472 flow [2025-01-09 21:25:13,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1472, PETRI_PLACES=464, PETRI_TRANSITIONS=455} [2025-01-09 21:25:13,389 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 89 predicate places. [2025-01-09 21:25:13,389 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 455 transitions, 1472 flow [2025-01-09 21:25:13,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 357.6842105263158) internal successors, (6796), 19 states have internal predecessors, (6796), 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:25:13,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:13,391 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:13,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:25:13,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:13,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:13,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1315109334, now seen corresponding path program 2 times [2025-01-09 21:25:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:13,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381410013] [2025-01-09 21:25:13,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:13,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1445 statements into 2 equivalence classes. [2025-01-09 21:25:13,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 127 of 1445 statements. [2025-01-09 21:25:13,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:13,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2025-01-09 21:25:14,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:14,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381410013] [2025-01-09 21:25:14,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381410013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:14,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920026113] [2025-01-09 21:25:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:14,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:14,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:14,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:14,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:15,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 379 [2025-01-09 21:25:15,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 455 transitions, 1472 flow. Second operand has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 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:25:15,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:15,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 379 [2025-01-09 21:25:15,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:16,137 INFO L124 PetriNetUnfolderBase]: 311/4016 cut-off events. [2025-01-09 21:25:16,137 INFO L125 PetriNetUnfolderBase]: For 710/744 co-relation queries the response was YES. [2025-01-09 21:25:16,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 4016 events. 311/4016 cut-off events. For 710/744 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15634 event pairs, 61 based on Foata normal form. 8/3810 useless extension candidates. Maximal degree in co-relation 3815. Up to 1009 conditions per place. [2025-01-09 21:25:16,150 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 84 selfloop transitions, 31 changer transitions 0/494 dead transitions. [2025-01-09 21:25:16,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 494 transitions, 1822 flow [2025-01-09 21:25:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2025-01-09 21:25:16,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876429199648197 [2025-01-09 21:25:16,152 INFO L175 Difference]: Start difference. First operand has 464 places, 455 transitions, 1472 flow. Second operand 6 states and 1993 transitions. [2025-01-09 21:25:16,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 494 transitions, 1822 flow [2025-01-09 21:25:16,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 494 transitions, 1746 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-01-09 21:25:16,166 INFO L231 Difference]: Finished difference. Result has 467 places, 485 transitions, 1654 flow [2025-01-09 21:25:16,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1654, PETRI_PLACES=467, PETRI_TRANSITIONS=485} [2025-01-09 21:25:16,167 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 92 predicate places. [2025-01-09 21:25:16,167 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 485 transitions, 1654 flow [2025-01-09 21:25:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 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:25:16,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:16,168 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:16,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:25:16,168 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:16,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash 979448184, now seen corresponding path program 1 times [2025-01-09 21:25:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326773840] [2025-01-09 21:25:16,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:16,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-01-09 21:25:16,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-01-09 21:25:16,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:16,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-01-09 21:25:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326773840] [2025-01-09 21:25:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326773840] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60509733] [2025-01-09 21:25:19,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:19,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:19,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:19,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:25:19,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-01-09 21:25:20,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-01-09 21:25:20,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:20,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:20,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 5678 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:25:20,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-01-09 21:25:21,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-01-09 21:25:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60509733] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:22,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-09 21:25:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455980712] [2025-01-09 21:25:22,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:22,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 21:25:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:22,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 21:25:22,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 21:25:22,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-01-09 21:25:22,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 485 transitions, 1654 flow. Second operand has 34 states, 34 states have (on average 363.1764705882353) internal successors, (12348), 34 states have internal predecessors, (12348), 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:25:22,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:22,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-01-09 21:25:22,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:24,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([758] L1044-->L1044-3: Formula: (and (= |v_fThread1of1ForFork1_#t~ret20#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_89| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_89|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_89| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#c~0.offset=|v_~#c~0.offset_89|} OutVars{~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_11|, fThread1of1ForFork1_#t~ret20#1=|v_fThread1of1ForFork1_#t~ret20#1_1|, ~#c~0.offset=|v_~#c~0.offset_89|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret20#1][422], [436#true, 376#true, Black: 394#(= |ULTIMATE.start_main_~i~0#1| 0), 4591#true, 265#ULTIMATE.startFINALtrue, 1891#true, Black: 404#(= |ULTIMATE.start_main_~j~1#1| 0), 4602#true, 121#L1044-3true, Black: 3315#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 440#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 4502#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 4508#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), 72#L1044-3true, Black: 1268#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 1906#(<= |ULTIMATE.start_main_~i~0#1| 1), 378#true, Black: 3598#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 3062#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 4512#(and (= 0 |ULTIMATE.start_main_#t~post25#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4496#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 4538#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3326#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 1904#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1894#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4544#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4490#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 1895#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1893#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 1896#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4532#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4550#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4594#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 1902#true, Black: 4593#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 4596#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 4595#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0))]) [2025-01-09 21:25:24,399 INFO L294 olderBase$Statistics]: this new event has 2977 ancestors and is cut-off event [2025-01-09 21:25:24,399 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-01-09 21:25:24,399 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-01-09 21:25:24,399 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-01-09 21:25:25,580 INFO L124 PetriNetUnfolderBase]: 340/6486 cut-off events. [2025-01-09 21:25:25,580 INFO L125 PetriNetUnfolderBase]: For 3587/3605 co-relation queries the response was YES. [2025-01-09 21:25:25,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8384 conditions, 6486 events. 340/6486 cut-off events. For 3587/3605 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17906 event pairs, 100 based on Foata normal form. 30/6248 useless extension candidates. Maximal degree in co-relation 5734. Up to 259 conditions per place. [2025-01-09 21:25:25,600 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 47 selfloop transitions, 135 changer transitions 0/586 dead transitions. [2025-01-09 21:25:25,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 586 transitions, 2782 flow [2025-01-09 21:25:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 21:25:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 21:25:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16325 transitions. [2025-01-09 21:25:25,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571973028437408 [2025-01-09 21:25:25,617 INFO L175 Difference]: Start difference. First operand has 467 places, 485 transitions, 1654 flow. Second operand 45 states and 16325 transitions. [2025-01-09 21:25:25,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 586 transitions, 2782 flow [2025-01-09 21:25:25,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 586 transitions, 2782 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:25:25,738 INFO L231 Difference]: Finished difference. Result has 520 places, 560 transitions, 2528 flow [2025-01-09 21:25:25,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2528, PETRI_PLACES=520, PETRI_TRANSITIONS=560} [2025-01-09 21:25:25,739 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 145 predicate places. [2025-01-09 21:25:25,739 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 560 transitions, 2528 flow [2025-01-09 21:25:25,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 363.1764705882353) internal successors, (12348), 34 states have internal predecessors, (12348), 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:25:25,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:25,744 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:25,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:25:25,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:25,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:25,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:25,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1855121544, now seen corresponding path program 2 times [2025-01-09 21:25:25,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:25,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270104518] [2025-01-09 21:25:25,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:26,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2889 statements into 2 equivalence classes. [2025-01-09 21:25:26,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 131 of 2889 statements. [2025-01-09 21:25:26,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:26,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52741 trivial. 0 not checked. [2025-01-09 21:25:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270104518] [2025-01-09 21:25:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270104518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838055622] [2025-01-09 21:25:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:26,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:26,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:26,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:27,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-01-09 21:25:27,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 560 transitions, 2528 flow. Second operand has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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:25:27,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:27,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-01-09 21:25:27,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:30,377 INFO L124 PetriNetUnfolderBase]: 454/6743 cut-off events. [2025-01-09 21:25:30,377 INFO L125 PetriNetUnfolderBase]: For 2378/2470 co-relation queries the response was YES. [2025-01-09 21:25:30,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10686 conditions, 6743 events. 454/6743 cut-off events. For 2378/2470 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21283 event pairs, 87 based on Foata normal form. 34/6546 useless extension candidates. Maximal degree in co-relation 7275. Up to 1847 conditions per place. [2025-01-09 21:25:30,401 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 108 selfloop transitions, 55 changer transitions 0/621 dead transitions. [2025-01-09 21:25:30,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 621 transitions, 3180 flow [2025-01-09 21:25:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1990 transitions. [2025-01-09 21:25:30,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8751099384344767 [2025-01-09 21:25:30,403 INFO L175 Difference]: Start difference. First operand has 520 places, 560 transitions, 2528 flow. Second operand 6 states and 1990 transitions. [2025-01-09 21:25:30,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 621 transitions, 3180 flow [2025-01-09 21:25:30,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 621 transitions, 3072 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-01-09 21:25:30,429 INFO L231 Difference]: Finished difference. Result has 512 places, 609 transitions, 2974 flow [2025-01-09 21:25:30,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2974, PETRI_PLACES=512, PETRI_TRANSITIONS=609} [2025-01-09 21:25:30,430 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 137 predicate places. [2025-01-09 21:25:30,430 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 609 transitions, 2974 flow [2025-01-09 21:25:30,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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:25:30,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:30,432 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:30,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:25:30,432 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:30,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash 770750739, now seen corresponding path program 1 times [2025-01-09 21:25:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726720863] [2025-01-09 21:25:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:30,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2895 statements into 1 equivalence classes. [2025-01-09 21:25:31,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2895 of 2895 statements. [2025-01-09 21:25:31,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:31,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-01-09 21:25:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726720863] [2025-01-09 21:25:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726720863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546314371] [2025-01-09 21:25:42,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:42,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:42,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:42,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:42,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:25:43,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2895 statements into 1 equivalence classes. [2025-01-09 21:25:45,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2895 of 2895 statements. [2025-01-09 21:25:45,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:45,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:45,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 11584 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:25:45,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-01-09 21:25:46,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-01-09 21:25:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546314371] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:48,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-01-09 21:25:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901144008] [2025-01-09 21:25:48,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:48,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 21:25:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:48,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 21:25:48,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 21:25:48,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-01-09 21:25:48,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 609 transitions, 2974 flow. Second operand has 63 states, 63 states have (on average 363.14285714285717) internal successors, (22878), 63 states have internal predecessors, (22878), 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:25:48,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:48,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-01-09 21:25:48,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:54,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([758] L1044-->L1044-3: Formula: (and (= |v_fThread1of1ForFork1_#t~ret20#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_89| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_89|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_89| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#c~0.offset=|v_~#c~0.offset_89|} OutVars{~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_11|, fThread1of1ForFork1_#t~ret20#1=|v_fThread1of1ForFork1_#t~ret20#1_1|, ~#c~0.offset=|v_~#c~0.offset_89|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret20#1][541], [Black: 394#(= |ULTIMATE.start_main_~i~0#1| 0), 4591#true, 265#ULTIMATE.startFINALtrue, 1891#true, 13400#true, Black: 404#(= |ULTIMATE.start_main_~j~1#1| 0), 121#L1044-3true, 72#L1044-3true, 378#true, 436#true, Black: 11363#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 4618#(<= |ULTIMATE.start_main_~j~1#1| 7), Black: 11635#(< |ULTIMATE.start_main_~j~1#1| 27), 376#true, Black: 11080#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 11907#(< |ULTIMATE.start_main_~j~1#1| 26), Black: 12451#(< |ULTIMATE.start_main_~j~1#1| 24), Black: 12179#(< |ULTIMATE.start_main_~j~1#1| 25), Black: 11091#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 13391#(= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0), Black: 13393#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 2 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), Black: 13394#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 2 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 3 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), Black: 13392#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), 4602#true, Black: 3315#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 440#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 4502#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 4508#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), 13389#true, Black: 1268#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 1906#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 3598#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 3062#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 4512#(and (= 0 |ULTIMATE.start_main_#t~post25#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4496#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 4538#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3326#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 1904#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1894#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4544#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4490#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 1895#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1893#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 4532#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 1896#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4550#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4594#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 1902#true, Black: 4593#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 4596#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 4595#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0))]) [2025-01-09 21:25:54,864 INFO L294 olderBase$Statistics]: this new event has 5677 ancestors and is cut-off event [2025-01-09 21:25:54,864 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-01-09 21:25:54,864 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-01-09 21:25:54,864 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-01-09 21:25:58,660 INFO L124 PetriNetUnfolderBase]: 526/11268 cut-off events. [2025-01-09 21:25:58,660 INFO L125 PetriNetUnfolderBase]: For 15181/15279 co-relation queries the response was YES. [2025-01-09 21:25:58,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15515 conditions, 11268 events. 526/11268 cut-off events. For 15181/15279 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 24662 event pairs, 115 based on Foata normal form. 81/11018 useless extension candidates. Maximal degree in co-relation 12202. Up to 318 conditions per place. [2025-01-09 21:25:58,692 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 92 selfloop transitions, 270 changer transitions 0/815 dead transitions. [2025-01-09 21:25:58,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 815 transitions, 5884 flow [2025-01-09 21:25:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-01-09 21:25:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-01-09 21:25:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 32637 transitions. [2025-01-09 21:25:58,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956816182937555 [2025-01-09 21:25:58,708 INFO L175 Difference]: Start difference. First operand has 512 places, 609 transitions, 2974 flow. Second operand 90 states and 32637 transitions. [2025-01-09 21:25:58,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 815 transitions, 5884 flow [2025-01-09 21:25:58,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 815 transitions, 5884 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:25:58,752 INFO L231 Difference]: Finished difference. Result has 617 places, 747 transitions, 4966 flow [2025-01-09 21:25:58,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=2974, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4966, PETRI_PLACES=617, PETRI_TRANSITIONS=747} [2025-01-09 21:25:58,753 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 242 predicate places. [2025-01-09 21:25:58,754 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 747 transitions, 4966 flow [2025-01-09 21:25:58,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 363.14285714285717) internal successors, (22878), 63 states have internal predecessors, (22878), 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:25:58,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:58,763 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:58,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:25:58,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 21:25:58,963 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:25:58,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash 808442963, now seen corresponding path program 2 times [2025-01-09 21:25:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:58,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444539499] [2025-01-09 21:25:58,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:59,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5595 statements into 2 equivalence classes. [2025-01-09 21:25:59,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 137 of 5595 statements. [2025-01-09 21:25:59,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:59,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 213451 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213451 trivial. 0 not checked. [2025-01-09 21:25:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444539499] [2025-01-09 21:25:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444539499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:59,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104232455] [2025-01-09 21:25:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:59,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:59,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:59,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:00,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-01-09 21:26:00,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 747 transitions, 4966 flow. Second operand has 6 states, 6 states have (on average 323.6666666666667) internal successors, (1942), 6 states have internal predecessors, (1942), 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:26:00,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:00,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-01-09 21:26:00,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand