./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.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_17-arrayloop_nr.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 b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:24:15,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:24:15,815 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:15,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:24:15,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:24:15,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:24:15,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:24:15,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:24:15,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:24:15,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:24:15,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:24:15,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:24:15,845 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:24:15,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:15,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:15,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:24:15,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:24:15,846 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2025-01-09 21:24:16,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:24:16,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:24:16,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:24:16,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:24:16,078 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:24:16,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-01-09 21:24:17,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48902c7fc/f3f3345b27864d50ace4b5009f0f7835/FLAGd4fcbd4bb [2025-01-09 21:24:17,604 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:24:17,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-01-09 21:24:17,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48902c7fc/f3f3345b27864d50ace4b5009f0f7835/FLAGd4fcbd4bb [2025-01-09 21:24:17,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48902c7fc/f3f3345b27864d50ace4b5009f0f7835 [2025-01-09 21:24:17,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:24:17,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:24:17,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:17,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:24:17,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:24:17,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:17" (1/1) ... [2025-01-09 21:24:17,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60bb413f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:17, skipping insertion in model container [2025-01-09 21:24:17,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:17" (1/1) ... [2025-01-09 21:24:17,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:24:18,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:18,212 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:24:18,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:18,298 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:24:18,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:18 WrapperNode [2025-01-09 21:24:18,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:18,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:18,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:24:18,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:24:18,306 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:18" (1/1) ... [2025-01-09 21:24:18,318 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:18" (1/1) ... [2025-01-09 21:24:18,339 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 283 [2025-01-09 21:24:18,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:18,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:24:18,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:24:18,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:24:18,347 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:18" (1/1) ... [2025-01-09 21:24:18,348 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:18" (1/1) ... [2025-01-09 21:24:18,352 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:18" (1/1) ... [2025-01-09 21:24:18,352 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:18" (1/1) ... [2025-01-09 21:24:18,367 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:18" (1/1) ... [2025-01-09 21:24:18,368 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:18" (1/1) ... [2025-01-09 21:24:18,370 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:18" (1/1) ... [2025-01-09 21:24:18,372 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:18" (1/1) ... [2025-01-09 21:24:18,372 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:18" (1/1) ... [2025-01-09 21:24:18,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:24:18,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:24:18,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:24:18,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:24:18,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:18" (1/1) ... [2025-01-09 21:24:18,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:18,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:18,402 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:18,404 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:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:24:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:24:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:24:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:24:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:24:18,420 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:18,507 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:24:18,508 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:24:18,967 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:24:18,967 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:24:18,983 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:24:18,983 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:24:18,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:18 BoogieIcfgContainer [2025-01-09 21:24:18,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:24:18,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:24:18,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:24:18,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:24:18,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:24:17" (1/3) ... [2025-01-09 21:24:18,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cba43c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:18, skipping insertion in model container [2025-01-09 21:24:18,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:18" (2/3) ... [2025-01-09 21:24:18,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cba43c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:18, skipping insertion in model container [2025-01-09 21:24:18,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:18" (3/3) ... [2025-01-09 21:24:18,990 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-01-09 21:24:18,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:24:19,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 319 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-01-09 21:24:19,000 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:24:19,054 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:24:19,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 321 transitions, 646 flow [2025-01-09 21:24:19,147 INFO L124 PetriNetUnfolderBase]: 3/320 cut-off events. [2025-01-09 21:24:19,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:19,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 320 events. 3/320 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 414 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 199. Up to 2 conditions per place. [2025-01-09 21:24:19,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 321 transitions, 646 flow [2025-01-09 21:24:19,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 320 transitions, 643 flow [2025-01-09 21:24:19,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:24:19,171 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;@35308a32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:24:19,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-09 21:24:19,201 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:24:19,201 INFO L124 PetriNetUnfolderBase]: 0/122 cut-off events. [2025-01-09 21:24:19,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:19,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:19,202 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] [2025-01-09 21:24:19,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash -154656294, now seen corresponding path program 1 times [2025-01-09 21:24:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605140236] [2025-01-09 21:24:19,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:19,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:24:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:24:19,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:19,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:20,042 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:20,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:20,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605140236] [2025-01-09 21:24:20,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605140236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:20,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:20,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160967761] [2025-01-09 21:24:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:20,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:20,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:20,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:20,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:20,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 321 [2025-01-09 21:24:20,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 320 transitions, 643 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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:20,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:20,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 321 [2025-01-09 21:24:20,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:21,439 INFO L124 PetriNetUnfolderBase]: 1265/4916 cut-off events. [2025-01-09 21:24:21,439 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:24:21,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 4916 events. 1265/4916 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 36245 event pairs, 912 based on Foata normal form. 0/4506 useless extension candidates. Maximal degree in co-relation 7320. Up to 2359 conditions per place. [2025-01-09 21:24:21,458 INFO L140 encePairwiseOnDemand]: 284/321 looper letters, 84 selfloop transitions, 107 changer transitions 0/428 dead transitions. [2025-01-09 21:24:21,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 428 transitions, 1241 flow [2025-01-09 21:24:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1621 transitions. [2025-01-09 21:24:21,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416407061266874 [2025-01-09 21:24:21,478 INFO L175 Difference]: Start difference. First operand has 321 places, 320 transitions, 643 flow. Second operand 6 states and 1621 transitions. [2025-01-09 21:24:21,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 428 transitions, 1241 flow [2025-01-09 21:24:21,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 428 transitions, 1240 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:21,497 INFO L231 Difference]: Finished difference. Result has 329 places, 420 transitions, 1330 flow [2025-01-09 21:24:21,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1330, PETRI_PLACES=329, PETRI_TRANSITIONS=420} [2025-01-09 21:24:21,505 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 8 predicate places. [2025-01-09 21:24:21,505 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 420 transitions, 1330 flow [2025-01-09 21:24:21,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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:21,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:21,510 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] [2025-01-09 21:24:21,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:24:21,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:21,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1765553760, now seen corresponding path program 1 times [2025-01-09 21:24:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746542309] [2025-01-09 21:24:21,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:21,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:21,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:24:21,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:24:21,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:21,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:21,925 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:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746542309] [2025-01-09 21:24:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746542309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:21,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689736249] [2025-01-09 21:24:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:21,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:21,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:22,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 321 [2025-01-09 21:24:22,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 420 transitions, 1330 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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:22,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:22,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 321 [2025-01-09 21:24:22,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:23,010 INFO L124 PetriNetUnfolderBase]: 1531/5800 cut-off events. [2025-01-09 21:24:23,011 INFO L125 PetriNetUnfolderBase]: For 1217/1220 co-relation queries the response was YES. [2025-01-09 21:24:23,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10592 conditions, 5800 events. 1531/5800 cut-off events. For 1217/1220 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 44217 event pairs, 936 based on Foata normal form. 0/5357 useless extension candidates. Maximal degree in co-relation 10439. Up to 2637 conditions per place. [2025-01-09 21:24:23,033 INFO L140 encePairwiseOnDemand]: 284/321 looper letters, 180 selfloop transitions, 107 changer transitions 0/528 dead transitions. [2025-01-09 21:24:23,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 528 transitions, 2312 flow [2025-01-09 21:24:23,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1621 transitions. [2025-01-09 21:24:23,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416407061266874 [2025-01-09 21:24:23,036 INFO L175 Difference]: Start difference. First operand has 329 places, 420 transitions, 1330 flow. Second operand 6 states and 1621 transitions. [2025-01-09 21:24:23,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 528 transitions, 2312 flow [2025-01-09 21:24:23,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 528 transitions, 2312 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:23,056 INFO L231 Difference]: Finished difference. Result has 338 places, 520 transitions, 2210 flow [2025-01-09 21:24:23,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2210, PETRI_PLACES=338, PETRI_TRANSITIONS=520} [2025-01-09 21:24:23,057 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 17 predicate places. [2025-01-09 21:24:23,057 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 520 transitions, 2210 flow [2025-01-09 21:24:23,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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:23,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:23,058 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] [2025-01-09 21:24:23,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:24:23,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:23,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1264270578, now seen corresponding path program 1 times [2025-01-09 21:24:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:23,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603314106] [2025-01-09 21:24:23,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:23,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:24:23,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:24:23,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:23,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:23,162 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:23,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:23,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603314106] [2025-01-09 21:24:23,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603314106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:23,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:23,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:24:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066972431] [2025-01-09 21:24:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:24:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:23,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:24:23,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:24:23,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 321 [2025-01-09 21:24:23,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 520 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:24:23,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:23,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 321 [2025-01-09 21:24:23,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:23,629 INFO L124 PetriNetUnfolderBase]: 1081/4426 cut-off events. [2025-01-09 21:24:23,629 INFO L125 PetriNetUnfolderBase]: For 1106/1112 co-relation queries the response was YES. [2025-01-09 21:24:23,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8836 conditions, 4426 events. 1081/4426 cut-off events. For 1106/1112 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 28601 event pairs, 108 based on Foata normal form. 4/4184 useless extension candidates. Maximal degree in co-relation 8615. Up to 1137 conditions per place. [2025-01-09 21:24:23,651 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 16 selfloop transitions, 4 changer transitions 0/526 dead transitions. [2025-01-09 21:24:23,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 526 transitions, 2262 flow [2025-01-09 21:24:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:24:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:24:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2025-01-09 21:24:23,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9792315680166147 [2025-01-09 21:24:23,653 INFO L175 Difference]: Start difference. First operand has 338 places, 520 transitions, 2210 flow. Second operand 3 states and 943 transitions. [2025-01-09 21:24:23,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 526 transitions, 2262 flow [2025-01-09 21:24:23,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 526 transitions, 2070 flow, removed 96 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:23,666 INFO L231 Difference]: Finished difference. Result has 341 places, 522 transitions, 2042 flow [2025-01-09 21:24:23,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2042, PETRI_PLACES=341, PETRI_TRANSITIONS=522} [2025-01-09 21:24:23,667 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 20 predicate places. [2025-01-09 21:24:23,667 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 522 transitions, 2042 flow [2025-01-09 21:24:23,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:24:23,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:23,668 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] [2025-01-09 21:24:23,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:24:23,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:23,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash -469721372, now seen corresponding path program 1 times [2025-01-09 21:24:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27464914] [2025-01-09 21:24:23,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:23,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:24:23,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:24:23,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:23,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:23,990 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:23,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:23,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27464914] [2025-01-09 21:24:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27464914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:23,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611426615] [2025-01-09 21:24:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:23,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:23,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:23,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:24,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 321 [2025-01-09 21:24:24,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 522 transitions, 2042 flow. Second operand has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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:24,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:24,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 321 [2025-01-09 21:24:24,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:25,663 INFO L124 PetriNetUnfolderBase]: 2970/10686 cut-off events. [2025-01-09 21:24:25,663 INFO L125 PetriNetUnfolderBase]: For 6020/6123 co-relation queries the response was YES. [2025-01-09 21:24:25,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23742 conditions, 10686 events. 2970/10686 cut-off events. For 6020/6123 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 84619 event pairs, 1872 based on Foata normal form. 0/10145 useless extension candidates. Maximal degree in co-relation 23486. Up to 5591 conditions per place. [2025-01-09 21:24:25,707 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 285 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-01-09 21:24:25,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 521 transitions, 2620 flow [2025-01-09 21:24:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-01-09 21:24:25,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7637590861889927 [2025-01-09 21:24:25,710 INFO L175 Difference]: Start difference. First operand has 341 places, 522 transitions, 2042 flow. Second operand 6 states and 1471 transitions. [2025-01-09 21:24:25,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 521 transitions, 2620 flow [2025-01-09 21:24:25,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 521 transitions, 2616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:25,723 INFO L231 Difference]: Finished difference. Result has 344 places, 521 transitions, 2046 flow [2025-01-09 21:24:25,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2046, PETRI_PLACES=344, PETRI_TRANSITIONS=521} [2025-01-09 21:24:25,724 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 23 predicate places. [2025-01-09 21:24:25,725 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 521 transitions, 2046 flow [2025-01-09 21:24:25,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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:25,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:25,725 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] [2025-01-09 21:24:25,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:24:25,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:25,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash -690134643, now seen corresponding path program 1 times [2025-01-09 21:24:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935152722] [2025-01-09 21:24:25,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:25,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:24:25,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:24:25,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:25,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:25,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:25,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935152722] [2025-01-09 21:24:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935152722] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:25,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281245789] [2025-01-09 21:24:25,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:25,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:25,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:25,861 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:24:25,862 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:24:25,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:24:25,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:24:25,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:25,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:25,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:24:25,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:26,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281245789] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:26,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:26,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:24:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646771764] [2025-01-09 21:24:26,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:26,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:24:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:26,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:24:26,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:24:26,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-01-09 21:24:26,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 521 transitions, 2046 flow. Second operand has 10 states, 10 states have (on average 305.0) internal successors, (3050), 10 states have internal predecessors, (3050), 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:26,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:26,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-01-09 21:24:26,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:26,863 INFO L124 PetriNetUnfolderBase]: 1095/4581 cut-off events. [2025-01-09 21:24:26,863 INFO L125 PetriNetUnfolderBase]: For 683/689 co-relation queries the response was YES. [2025-01-09 21:24:26,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8884 conditions, 4581 events. 1095/4581 cut-off events. For 683/689 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 29153 event pairs, 106 based on Foata normal form. 2/4327 useless extension candidates. Maximal degree in co-relation 8588. Up to 922 conditions per place. [2025-01-09 21:24:26,880 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 22 selfloop transitions, 13 changer transitions 0/536 dead transitions. [2025-01-09 21:24:26,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 536 transitions, 2148 flow [2025-01-09 21:24:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:24:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:24:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2764 transitions. [2025-01-09 21:24:26,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9567324333679473 [2025-01-09 21:24:26,885 INFO L175 Difference]: Start difference. First operand has 344 places, 521 transitions, 2046 flow. Second operand 9 states and 2764 transitions. [2025-01-09 21:24:26,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 536 transitions, 2148 flow [2025-01-09 21:24:26,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 536 transitions, 2138 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:26,895 INFO L231 Difference]: Finished difference. Result has 350 places, 528 transitions, 2104 flow [2025-01-09 21:24:26,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2104, PETRI_PLACES=350, PETRI_TRANSITIONS=528} [2025-01-09 21:24:26,896 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 29 predicate places. [2025-01-09 21:24:26,896 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 528 transitions, 2104 flow [2025-01-09 21:24:26,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 305.0) internal successors, (3050), 10 states have internal predecessors, (3050), 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:26,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:26,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,908 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:24:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:27,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:27,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1929845971, now seen corresponding path program 2 times [2025-01-09 21:24:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:27,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381374561] [2025-01-09 21:24:27,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:27,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-01-09 21:24:27,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 220 statements. [2025-01-09 21:24:27,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:27,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-01-09 21:24:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:27,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381374561] [2025-01-09 21:24:27,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381374561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:27,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:27,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931652746] [2025-01-09 21:24:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:27,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:27,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:27,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:27,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 321 [2025-01-09 21:24:27,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 528 transitions, 2104 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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:27,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:27,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 321 [2025-01-09 21:24:27,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:30,123 INFO L124 PetriNetUnfolderBase]: 3572/12304 cut-off events. [2025-01-09 21:24:30,123 INFO L125 PetriNetUnfolderBase]: For 5280/5362 co-relation queries the response was YES. [2025-01-09 21:24:30,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26818 conditions, 12304 events. 3572/12304 cut-off events. For 5280/5362 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 97982 event pairs, 1616 based on Foata normal form. 0/11548 useless extension candidates. Maximal degree in co-relation 26484. Up to 6064 conditions per place. [2025-01-09 21:24:30,166 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 245 selfloop transitions, 170 changer transitions 0/697 dead transitions. [2025-01-09 21:24:30,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 697 transitions, 3412 flow [2025-01-09 21:24:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-01-09 21:24:30,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743509865005192 [2025-01-09 21:24:30,170 INFO L175 Difference]: Start difference. First operand has 350 places, 528 transitions, 2104 flow. Second operand 6 states and 1684 transitions. [2025-01-09 21:24:30,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 697 transitions, 3412 flow [2025-01-09 21:24:30,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 697 transitions, 3402 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:30,188 INFO L231 Difference]: Finished difference. Result has 359 places, 689 transitions, 3344 flow [2025-01-09 21:24:30,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3344, PETRI_PLACES=359, PETRI_TRANSITIONS=689} [2025-01-09 21:24:30,189 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 38 predicate places. [2025-01-09 21:24:30,189 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 689 transitions, 3344 flow [2025-01-09 21:24:30,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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:30,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:30,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:24:30,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:30,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:30,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2060109134, now seen corresponding path program 1 times [2025-01-09 21:24:30,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:30,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927881042] [2025-01-09 21:24:30,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:30,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:24:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:24:30,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:30,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927881042] [2025-01-09 21:24:30,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927881042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741308754] [2025-01-09 21:24:30,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:30,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:30,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:30,456 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:24:30,458 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:24:30,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:24:30,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:24:30,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:30,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:30,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:24:30,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:30,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741308754] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:30,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:30,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:24:30,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206153637] [2025-01-09 21:24:30,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:24:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:30,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:24:30,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:24:31,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-01-09 21:24:31,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 689 transitions, 3344 flow. Second operand has 18 states, 18 states have (on average 305.0) internal successors, (5490), 18 states have internal predecessors, (5490), 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:31,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:31,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-01-09 21:24:31,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:32,385 INFO L124 PetriNetUnfolderBase]: 1777/6922 cut-off events. [2025-01-09 21:24:32,385 INFO L125 PetriNetUnfolderBase]: For 3172/3271 co-relation queries the response was YES. [2025-01-09 21:24:32,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16027 conditions, 6922 events. 1777/6922 cut-off events. For 3172/3271 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 48142 event pairs, 163 based on Foata normal form. 4/6621 useless extension candidates. Maximal degree in co-relation 15426. Up to 1392 conditions per place. [2025-01-09 21:24:32,443 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 26 selfloop transitions, 25 changer transitions 0/713 dead transitions. [2025-01-09 21:24:32,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 713 transitions, 3546 flow [2025-01-09 21:24:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:24:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:24:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6418 transitions. [2025-01-09 21:24:32,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520842604954755 [2025-01-09 21:24:32,545 INFO L175 Difference]: Start difference. First operand has 359 places, 689 transitions, 3344 flow. Second operand 21 states and 6418 transitions. [2025-01-09 21:24:32,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 713 transitions, 3546 flow [2025-01-09 21:24:32,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 713 transitions, 3510 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:32,575 INFO L231 Difference]: Finished difference. Result has 384 places, 702 transitions, 3452 flow [2025-01-09 21:24:32,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=3308, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3452, PETRI_PLACES=384, PETRI_TRANSITIONS=702} [2025-01-09 21:24:32,578 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 63 predicate places. [2025-01-09 21:24:32,578 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 702 transitions, 3452 flow [2025-01-09 21:24:32,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 305.0) internal successors, (5490), 18 states have internal predecessors, (5490), 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:32,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:32,581 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:24:32,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:32,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:32,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:32,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1584170482, now seen corresponding path program 2 times [2025-01-09 21:24:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:32,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224260257] [2025-01-09 21:24:32,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:32,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 392 statements into 2 equivalence classes. [2025-01-09 21:24:32,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 392 statements. [2025-01-09 21:24:32,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:32,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2025-01-09 21:24:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224260257] [2025-01-09 21:24:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224260257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:33,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837942598] [2025-01-09 21:24:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:33,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:33,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:33,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:33,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 321 [2025-01-09 21:24:33,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 702 transitions, 3452 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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:33,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:33,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 321 [2025-01-09 21:24:33,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:36,746 INFO L124 PetriNetUnfolderBase]: 4263/14675 cut-off events. [2025-01-09 21:24:36,746 INFO L125 PetriNetUnfolderBase]: For 10453/10598 co-relation queries the response was YES. [2025-01-09 21:24:36,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37006 conditions, 14675 events. 4263/14675 cut-off events. For 10453/10598 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 119228 event pairs, 1677 based on Foata normal form. 0/13875 useless extension candidates. Maximal degree in co-relation 36312. Up to 6897 conditions per place. [2025-01-09 21:24:36,816 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 395 selfloop transitions, 170 changer transitions 0/871 dead transitions. [2025-01-09 21:24:36,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 871 transitions, 5360 flow [2025-01-09 21:24:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-01-09 21:24:36,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743509865005192 [2025-01-09 21:24:36,822 INFO L175 Difference]: Start difference. First operand has 384 places, 702 transitions, 3452 flow. Second operand 6 states and 1684 transitions. [2025-01-09 21:24:36,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 871 transitions, 5360 flow [2025-01-09 21:24:36,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 871 transitions, 5334 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:24:36,860 INFO L231 Difference]: Finished difference. Result has 388 places, 863 transitions, 4976 flow [2025-01-09 21:24:36,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4976, PETRI_PLACES=388, PETRI_TRANSITIONS=863} [2025-01-09 21:24:36,863 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 67 predicate places. [2025-01-09 21:24:36,863 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 863 transitions, 4976 flow [2025-01-09 21:24:36,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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:36,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:36,865 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:24:36,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:36,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash 210581893, now seen corresponding path program 1 times [2025-01-09 21:24:36,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:36,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379236223] [2025-01-09 21:24:36,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:36,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:36,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-01-09 21:24:36,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-01-09 21:24:36,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:36,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 0 proven. 910 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:37,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:37,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379236223] [2025-01-09 21:24:37,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379236223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:37,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827469945] [2025-01-09 21:24:37,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:37,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:37,483 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:24:37,485 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:24:37,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-01-09 21:24:37,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-01-09 21:24:37,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:37,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:24:37,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 0 proven. 910 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:38,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 0 proven. 910 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:38,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827469945] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:38,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:38,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:24:38,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527494500] [2025-01-09 21:24:38,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:24:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:38,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:24:38,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:24:38,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-01-09 21:24:38,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 863 transitions, 4976 flow. Second operand has 23 states, 23 states have (on average 305.2173913043478) internal successors, (7020), 23 states have internal predecessors, (7020), 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:38,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:38,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-01-09 21:24:38,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:41,360 INFO L124 PetriNetUnfolderBase]: 2478/9371 cut-off events. [2025-01-09 21:24:41,360 INFO L125 PetriNetUnfolderBase]: For 7419/7565 co-relation queries the response was YES. [2025-01-09 21:24:41,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24560 conditions, 9371 events. 2478/9371 cut-off events. For 7419/7565 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 68818 event pairs, 229 based on Foata normal form. 3/9000 useless extension candidates. Maximal degree in co-relation 23696. Up to 2110 conditions per place. [2025-01-09 21:24:41,413 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 29 selfloop transitions, 34 changer transitions 0/886 dead transitions. [2025-01-09 21:24:41,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 886 transitions, 5236 flow [2025-01-09 21:24:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:24:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:24:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9156 transitions. [2025-01-09 21:24:41,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950778816199377 [2025-01-09 21:24:41,423 INFO L175 Difference]: Start difference. First operand has 388 places, 863 transitions, 4976 flow. Second operand 30 states and 9156 transitions. [2025-01-09 21:24:41,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 886 transitions, 5236 flow [2025-01-09 21:24:41,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 886 transitions, 4900 flow, removed 168 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:41,493 INFO L231 Difference]: Finished difference. Result has 421 places, 873 transitions, 4806 flow [2025-01-09 21:24:41,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=4640, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4806, PETRI_PLACES=421, PETRI_TRANSITIONS=873} [2025-01-09 21:24:41,494 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 100 predicate places. [2025-01-09 21:24:41,494 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 873 transitions, 4806 flow [2025-01-09 21:24:41,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 305.2173913043478) internal successors, (7020), 23 states have internal predecessors, (7020), 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:41,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:41,496 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:24:41,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:41,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:41,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash 475270944, now seen corresponding path program 2 times [2025-01-09 21:24:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:41,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330311110] [2025-01-09 21:24:41,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:41,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:41,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 523 statements into 2 equivalence classes. [2025-01-09 21:24:41,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 113 of 523 statements. [2025-01-09 21:24:41,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:41,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1955 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1955 trivial. 0 not checked. [2025-01-09 21:24:42,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:42,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330311110] [2025-01-09 21:24:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330311110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:42,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:42,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:24:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574499120] [2025-01-09 21:24:42,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:24:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:42,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:24:42,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:24:43,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-01-09 21:24:43,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 873 transitions, 4806 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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:43,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:43,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-01-09 21:24:43,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:47,928 INFO L124 PetriNetUnfolderBase]: 4877/16068 cut-off events. [2025-01-09 21:24:47,929 INFO L125 PetriNetUnfolderBase]: For 17214/17649 co-relation queries the response was YES. [2025-01-09 21:24:47,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46677 conditions, 16068 events. 4877/16068 cut-off events. For 17214/17649 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 129028 event pairs, 1704 based on Foata normal form. 20/15366 useless extension candidates. Maximal degree in co-relation 45651. Up to 5419 conditions per place. [2025-01-09 21:24:47,999 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 591 selfloop transitions, 145 changer transitions 0/1041 dead transitions. [2025-01-09 21:24:47,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 1041 transitions, 7260 flow [2025-01-09 21:24:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:24:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:24:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3080 transitions. [2025-01-09 21:24:48,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2025-01-09 21:24:48,004 INFO L175 Difference]: Start difference. First operand has 421 places, 873 transitions, 4806 flow. Second operand 12 states and 3080 transitions. [2025-01-09 21:24:48,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 1041 transitions, 7260 flow [2025-01-09 21:24:48,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1041 transitions, 7212 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-01-09 21:24:48,073 INFO L231 Difference]: Finished difference. Result has 419 places, 892 transitions, 5384 flow [2025-01-09 21:24:48,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=4758, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5384, PETRI_PLACES=419, PETRI_TRANSITIONS=892} [2025-01-09 21:24:48,075 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 98 predicate places. [2025-01-09 21:24:48,075 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 892 transitions, 5384 flow [2025-01-09 21:24:48,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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:48,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:48,076 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:24:48,076 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:48,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1899771532, now seen corresponding path program 3 times [2025-01-09 21:24:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:48,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585169553] [2025-01-09 21:24:48,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:24:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:48,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 523 statements into 12 equivalence classes. [2025-01-09 21:24:48,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 113 of 523 statements. [2025-01-09 21:24:48,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:24:48,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1955 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1955 trivial. 0 not checked. [2025-01-09 21:24:48,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:48,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585169553] [2025-01-09 21:24:48,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585169553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:48,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:48,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:24:48,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049102819] [2025-01-09 21:24:48,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:48,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:24:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:48,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:24:48,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:24:49,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-01-09 21:24:49,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 892 transitions, 5384 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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:49,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:49,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-01-09 21:24:49,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:54,420 INFO L124 PetriNetUnfolderBase]: 5770/18258 cut-off events. [2025-01-09 21:24:54,420 INFO L125 PetriNetUnfolderBase]: For 24550/24748 co-relation queries the response was YES. [2025-01-09 21:24:54,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57797 conditions, 18258 events. 5770/18258 cut-off events. For 24550/24748 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 148177 event pairs, 1608 based on Foata normal form. 82/17663 useless extension candidates. Maximal degree in co-relation 56668. Up to 4534 conditions per place. [2025-01-09 21:24:54,534 INFO L140 encePairwiseOnDemand]: 280/321 looper letters, 868 selfloop transitions, 148 changer transitions 0/1321 dead transitions. [2025-01-09 21:24:54,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1321 transitions, 10834 flow [2025-01-09 21:24:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 21:24:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-09 21:24:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5615 transitions. [2025-01-09 21:24:54,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605309494785317 [2025-01-09 21:24:54,540 INFO L175 Difference]: Start difference. First operand has 419 places, 892 transitions, 5384 flow. Second operand 23 states and 5615 transitions. [2025-01-09 21:24:54,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1321 transitions, 10834 flow [2025-01-09 21:24:54,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 1321 transitions, 10620 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-09 21:24:54,637 INFO L231 Difference]: Finished difference. Result has 452 places, 1021 transitions, 7048 flow [2025-01-09 21:24:54,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=5268, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7048, PETRI_PLACES=452, PETRI_TRANSITIONS=1021} [2025-01-09 21:24:54,638 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 131 predicate places. [2025-01-09 21:24:54,638 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 1021 transitions, 7048 flow [2025-01-09 21:24:54,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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:54,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:54,639 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:24:54,640 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -688100040, now seen corresponding path program 4 times [2025-01-09 21:24:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:54,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77745409] [2025-01-09 21:24:54,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:24:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:54,705 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 523 statements into 2 equivalence classes. [2025-01-09 21:24:54,744 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 455 of 523 statements. [2025-01-09 21:24:54,744 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:24:54,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1955 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1955 trivial. 0 not checked. [2025-01-09 21:24:56,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77745409] [2025-01-09 21:24:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77745409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:24:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067253680] [2025-01-09 21:24:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:56,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:24:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:56,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:24:56,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:24:57,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-01-09 21:24:57,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 1021 transitions, 7048 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:57,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-01-09 21:24:57,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:03,332 INFO L124 PetriNetUnfolderBase]: 5852/18503 cut-off events. [2025-01-09 21:25:03,333 INFO L125 PetriNetUnfolderBase]: For 34129/34575 co-relation queries the response was YES. [2025-01-09 21:25:03,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62796 conditions, 18503 events. 5852/18503 cut-off events. For 34129/34575 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 150687 event pairs, 1708 based on Foata normal form. 50/17821 useless extension candidates. Maximal degree in co-relation 61680. Up to 5461 conditions per place. [2025-01-09 21:25:03,454 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 661 selfloop transitions, 237 changer transitions 0/1203 dead transitions. [2025-01-09 21:25:03,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1203 transitions, 10245 flow [2025-01-09 21:25:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:25:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:25:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3313 transitions. [2025-01-09 21:25:03,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7939132518571771 [2025-01-09 21:25:03,611 INFO L175 Difference]: Start difference. First operand has 452 places, 1021 transitions, 7048 flow. Second operand 13 states and 3313 transitions. [2025-01-09 21:25:03,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1203 transitions, 10245 flow [2025-01-09 21:25:03,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1203 transitions, 10133 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-01-09 21:25:03,802 INFO L231 Difference]: Finished difference. Result has 469 places, 1050 transitions, 8209 flow [2025-01-09 21:25:03,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=6982, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8209, PETRI_PLACES=469, PETRI_TRANSITIONS=1050} [2025-01-09 21:25:03,803 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 148 predicate places. [2025-01-09 21:25:03,803 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 1050 transitions, 8209 flow [2025-01-09 21:25:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:03,804 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:25:03,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:03,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1997051774, now seen corresponding path program 5 times [2025-01-09 21:25:03,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:03,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922884533] [2025-01-09 21:25:03,807 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:25:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:03,871 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 523 statements into 12 equivalence classes. [2025-01-09 21:25:04,147 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 523 of 523 statements. [2025-01-09 21:25:04,148 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-01-09 21:25:04,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1955 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1955 trivial. 0 not checked. [2025-01-09 21:25:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922884533] [2025-01-09 21:25:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922884533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:05,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:05,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:25:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32908385] [2025-01-09 21:25:05,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:05,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:25:05,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:05,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:25:05,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:25:06,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-01-09 21:25:06,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 1050 transitions, 8209 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:06,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-01-09 21:25:06,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand