./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.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_01-list_rc.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 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:53,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:53,656 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:22:53,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:53,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:53,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:53,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:53,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:53,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:53,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:53,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:53,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:53,686 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:53,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:53,687 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:53,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:53,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:53,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:53,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:53,688 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 -> 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc [2025-01-09 21:22:53,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:53,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:53,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:53,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:53,896 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:53,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2025-01-09 21:22:55,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1df5f247/a69057c65cb241009bd84be6b8aa974f/FLAG6398537ef [2025-01-09 21:22:55,442 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:55,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2025-01-09 21:22:55,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1df5f247/a69057c65cb241009bd84be6b8aa974f/FLAG6398537ef [2025-01-09 21:22:55,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1df5f247/a69057c65cb241009bd84be6b8aa974f [2025-01-09 21:22:55,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:55,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:55,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:55,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:55,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:55,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:55" (1/1) ... [2025-01-09 21:22:55,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b10f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:55, skipping insertion in model container [2025-01-09 21:22:55,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:55" (1/1) ... [2025-01-09 21:22:55,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:56,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:56,053 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:56,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:56,166 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:56,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56 WrapperNode [2025-01-09 21:22:56,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:56,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:56,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:56,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:56,174 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:22:56" (1/1) ... [2025-01-09 21:22:56,188 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:22:56" (1/1) ... [2025-01-09 21:22:56,213 INFO L138 Inliner]: procedures = 368, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2025-01-09 21:22:56,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:56,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:56,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:56,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:56,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:56,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:56,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:56,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:56,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (1/1) ... [2025-01-09 21:22:56,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:56,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:56,276 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:22:56,282 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:22:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:22:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:22:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:22:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:22:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:56,299 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:56,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:56,300 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:22:56,389 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:56,391 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:56,680 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:56,680 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:56,698 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:56,699 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:56,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:56 BoogieIcfgContainer [2025-01-09 21:22:56,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:56,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:56,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:56,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:56,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:55" (1/3) ... [2025-01-09 21:22:56,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4693e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:56, skipping insertion in model container [2025-01-09 21:22:56,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:56" (2/3) ... [2025-01-09 21:22:56,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4693e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:56, skipping insertion in model container [2025-01-09 21:22:56,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:56" (3/3) ... [2025-01-09 21:22:56,706 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_01-list_rc.i [2025-01-09 21:22:56,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:56,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_01-list_rc.i that has 2 procedures, 200 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-01-09 21:22:56,719 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:56,804 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:56,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 199 transitions, 402 flow [2025-01-09 21:22:56,897 INFO L124 PetriNetUnfolderBase]: 0/198 cut-off events. [2025-01-09 21:22:56,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:56,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 198 events. 0/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:22:56,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 199 transitions, 402 flow [2025-01-09 21:22:56,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 198 transitions, 399 flow [2025-01-09 21:22:56,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:56,919 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;@47e3d628, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:56,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:22:56,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:56,926 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-01-09 21:22:56,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:56,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:56,927 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] [2025-01-09 21:22:56,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:22:56,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 591670127, now seen corresponding path program 1 times [2025-01-09 21:22:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208068657] [2025-01-09 21:22:56,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:56,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:22:57,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:22:57,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:57,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:57,482 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:22:57,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208068657] [2025-01-09 21:22:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208068657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498339811] [2025-01-09 21:22:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:57,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:57,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:57,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:57,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 199 [2025-01-09 21:22:57,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 198 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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:22:57,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:57,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 199 [2025-01-09 21:22:57,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:58,071 INFO L124 PetriNetUnfolderBase]: 220/1022 cut-off events. [2025-01-09 21:22:58,071 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:58,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1022 events. 220/1022 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5351 event pairs, 220 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-01-09 21:22:58,080 INFO L140 encePairwiseOnDemand]: 187/199 looper letters, 47 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2025-01-09 21:22:58,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 196 transitions, 509 flow [2025-01-09 21:22:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions. [2025-01-09 21:22:58,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529313232830821 [2025-01-09 21:22:58,092 INFO L175 Difference]: Start difference. First operand has 202 places, 198 transitions, 399 flow. Second operand 6 states and 899 transitions. [2025-01-09 21:22:58,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 196 transitions, 509 flow [2025-01-09 21:22:58,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 196 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:58,098 INFO L231 Difference]: Finished difference. Result has 204 places, 196 transitions, 414 flow [2025-01-09 21:22:58,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=204, PETRI_TRANSITIONS=196} [2025-01-09 21:22:58,102 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 2 predicate places. [2025-01-09 21:22:58,102 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 196 transitions, 414 flow [2025-01-09 21:22:58,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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:22:58,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:58,102 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] [2025-01-09 21:22:58,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:58,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:22:58,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1151147682, now seen corresponding path program 1 times [2025-01-09 21:22:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:58,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889766100] [2025-01-09 21:22:58,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:58,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:58,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:22:58,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:22:58,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:58,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:58,394 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:22:58,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:58,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889766100] [2025-01-09 21:22:58,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889766100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:58,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:58,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:58,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508697678] [2025-01-09 21:22:58,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:58,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:58,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:58,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 199 [2025-01-09 21:22:58,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 196 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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:22:58,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:58,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 199 [2025-01-09 21:22:58,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:58,784 INFO L124 PetriNetUnfolderBase]: 220/1020 cut-off events. [2025-01-09 21:22:58,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 1020 events. 220/1020 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5380 event pairs, 220 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-01-09 21:22:58,788 INFO L140 encePairwiseOnDemand]: 187/199 looper letters, 47 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2025-01-09 21:22:58,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 194 transitions, 524 flow [2025-01-09 21:22:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions. [2025-01-09 21:22:58,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529313232830821 [2025-01-09 21:22:58,790 INFO L175 Difference]: Start difference. First operand has 204 places, 196 transitions, 414 flow. Second operand 6 states and 899 transitions. [2025-01-09 21:22:58,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 194 transitions, 524 flow [2025-01-09 21:22:58,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 504 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:22:58,793 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2025-01-09 21:22:58,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2025-01-09 21:22:58,793 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 0 predicate places. [2025-01-09 21:22:58,794 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2025-01-09 21:22:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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:22:58,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:58,794 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] [2025-01-09 21:22:58,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:22:58,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:22:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1922634844, now seen corresponding path program 1 times [2025-01-09 21:22:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:58,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402728167] [2025-01-09 21:22:58,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:58,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:22:58,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:22:58,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:58,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:58,826 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:22:58,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:58,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402728167] [2025-01-09 21:22:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402728167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:58,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:58,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:22:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587238795] [2025-01-09 21:22:58,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:58,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:58,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:58,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:58,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 199 [2025-01-09 21:22:58,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:22:58,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:58,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 199 [2025-01-09 21:22:58,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:58,887 INFO L124 PetriNetUnfolderBase]: 16/329 cut-off events. [2025-01-09 21:22:58,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:58,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 329 events. 16/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 760 event pairs, 16 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-01-09 21:22:58,888 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 14 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-01-09 21:22:58,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 193 transitions, 440 flow [2025-01-09 21:22:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2025-01-09 21:22:58,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430485762144054 [2025-01-09 21:22:58,890 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 563 transitions. [2025-01-09 21:22:58,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 193 transitions, 440 flow [2025-01-09 21:22:58,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 193 transitions, 420 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:22:58,895 INFO L231 Difference]: Finished difference. Result has 198 places, 193 transitions, 392 flow [2025-01-09 21:22:58,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=198, PETRI_TRANSITIONS=193} [2025-01-09 21:22:58,896 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -4 predicate places. [2025-01-09 21:22:58,896 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 193 transitions, 392 flow [2025-01-09 21:22:58,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:22:58,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:58,896 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] [2025-01-09 21:22:58,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:58,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:22:58,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1671024064, now seen corresponding path program 1 times [2025-01-09 21:22:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:58,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318986183] [2025-01-09 21:22:58,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:58,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:58,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:22:58,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:22:58,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:58,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:58,937 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:22:58,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318986183] [2025-01-09 21:22:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318986183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:58,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:22:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976310264] [2025-01-09 21:22:58,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:58,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:58,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:58,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:58,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 199 [2025-01-09 21:22:58,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 193 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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:22:58,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:58,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 199 [2025-01-09 21:22:58,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:59,004 INFO L124 PetriNetUnfolderBase]: 24/406 cut-off events. [2025-01-09 21:22:59,004 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:59,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 406 events. 24/406 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs, 24 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-01-09 21:22:59,005 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 15 selfloop transitions, 1 changer transitions 0/188 dead transitions. [2025-01-09 21:22:59,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 414 flow [2025-01-09 21:22:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-01-09 21:22:59,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9296482412060302 [2025-01-09 21:22:59,007 INFO L175 Difference]: Start difference. First operand has 198 places, 193 transitions, 392 flow. Second operand 3 states and 555 transitions. [2025-01-09 21:22:59,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 188 transitions, 414 flow [2025-01-09 21:22:59,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 188 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:22:59,011 INFO L231 Difference]: Finished difference. Result has 193 places, 188 transitions, 380 flow [2025-01-09 21:22:59,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=193, PETRI_TRANSITIONS=188} [2025-01-09 21:22:59,012 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -9 predicate places. [2025-01-09 21:22:59,012 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 188 transitions, 380 flow [2025-01-09 21:22:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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:22:59,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:59,012 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] [2025-01-09 21:22:59,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:22:59,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:22:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1346216130, now seen corresponding path program 1 times [2025-01-09 21:22:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030012177] [2025-01-09 21:22:59,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:59,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:22:59,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:22:59,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:59,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:59,391 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:22:59,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:59,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030012177] [2025-01-09 21:22:59,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030012177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:59,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:59,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039892397] [2025-01-09 21:22:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:59,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:59,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:59,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:59,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:59,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 199 [2025-01-09 21:22:59,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 188 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 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:22:59,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:59,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 199 [2025-01-09 21:22:59,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:59,759 INFO L124 PetriNetUnfolderBase]: 288/1159 cut-off events. [2025-01-09 21:22:59,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:59,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1159 events. 288/1159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6281 event pairs, 288 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-01-09 21:22:59,763 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 58 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-01-09 21:22:59,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 187 transitions, 504 flow [2025-01-09 21:22:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-01-09 21:22:59,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7319932998324958 [2025-01-09 21:22:59,765 INFO L175 Difference]: Start difference. First operand has 193 places, 188 transitions, 380 flow. Second operand 6 states and 874 transitions. [2025-01-09 21:22:59,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 187 transitions, 504 flow [2025-01-09 21:22:59,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 187 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:59,767 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 387 flow [2025-01-09 21:22:59,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=196, PETRI_TRANSITIONS=187} [2025-01-09 21:22:59,768 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -6 predicate places. [2025-01-09 21:22:59,768 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 387 flow [2025-01-09 21:22:59,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 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:22:59,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:59,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:59,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:59,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:22:59,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash 986575562, now seen corresponding path program 1 times [2025-01-09 21:22:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948551768] [2025-01-09 21:22:59,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:59,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:22:59,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:22:59,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:59,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:00,144 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:23:00,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:00,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948551768] [2025-01-09 21:23:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948551768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:00,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:00,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:00,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681110564] [2025-01-09 21:23:00,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:00,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:00,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:00,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:00,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:00,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 199 [2025-01-09 21:23:00,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 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:23:00,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:00,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 199 [2025-01-09 21:23:00,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:00,699 INFO L124 PetriNetUnfolderBase]: 316/1485 cut-off events. [2025-01-09 21:23:00,699 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:00,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 1485 events. 316/1485 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9183 event pairs, 36 based on Foata normal form. 0/1395 useless extension candidates. Maximal degree in co-relation 2154. Up to 380 conditions per place. [2025-01-09 21:23:00,704 INFO L140 encePairwiseOnDemand]: 171/199 looper letters, 99 selfloop transitions, 70 changer transitions 0/299 dead transitions. [2025-01-09 21:23:00,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 299 transitions, 949 flow [2025-01-09 21:23:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1023 transitions. [2025-01-09 21:23:00,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567839195979899 [2025-01-09 21:23:00,708 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 387 flow. Second operand 6 states and 1023 transitions. [2025-01-09 21:23:00,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 299 transitions, 949 flow [2025-01-09 21:23:00,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 299 transitions, 939 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:00,713 INFO L231 Difference]: Finished difference. Result has 200 places, 257 transitions, 855 flow [2025-01-09 21:23:00,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=855, PETRI_PLACES=200, PETRI_TRANSITIONS=257} [2025-01-09 21:23:00,714 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -2 predicate places. [2025-01-09 21:23:00,714 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 257 transitions, 855 flow [2025-01-09 21:23:00,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 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:23:00,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:00,714 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] [2025-01-09 21:23:00,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:23:00,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1434126713, now seen corresponding path program 1 times [2025-01-09 21:23:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402576805] [2025-01-09 21:23:00,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:00,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:23:00,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:23:00,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:00,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:01,102 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:23:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402576805] [2025-01-09 21:23:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402576805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:01,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:01,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452031634] [2025-01-09 21:23:01,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:01,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:01,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:01,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:01,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 199 [2025-01-09 21:23:01,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 257 transitions, 855 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 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:23:01,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:01,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 199 [2025-01-09 21:23:01,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:01,544 INFO L124 PetriNetUnfolderBase]: 588/2256 cut-off events. [2025-01-09 21:23:01,544 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-01-09 21:23:01,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 2256 events. 588/2256 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15135 event pairs, 222 based on Foata normal form. 0/2145 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-01-09 21:23:01,552 INFO L140 encePairwiseOnDemand]: 184/199 looper letters, 106 selfloop transitions, 48 changer transitions 0/308 dead transitions. [2025-01-09 21:23:01,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 308 transitions, 1335 flow [2025-01-09 21:23:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions. [2025-01-09 21:23:01,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8040201005025126 [2025-01-09 21:23:01,554 INFO L175 Difference]: Start difference. First operand has 200 places, 257 transitions, 855 flow. Second operand 6 states and 960 transitions. [2025-01-09 21:23:01,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 308 transitions, 1335 flow [2025-01-09 21:23:01,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 308 transitions, 1335 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:01,563 INFO L231 Difference]: Finished difference. Result has 210 places, 300 transitions, 1243 flow [2025-01-09 21:23:01,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1243, PETRI_PLACES=210, PETRI_TRANSITIONS=300} [2025-01-09 21:23:01,564 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 8 predicate places. [2025-01-09 21:23:01,564 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 300 transitions, 1243 flow [2025-01-09 21:23:01,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 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:23:01,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:01,564 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] [2025-01-09 21:23:01,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:23:01,564 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:01,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1941046839, now seen corresponding path program 1 times [2025-01-09 21:23:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:01,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049406444] [2025-01-09 21:23:01,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:01,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:23:01,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:23:01,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:01,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:01,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:01,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049406444] [2025-01-09 21:23:01,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049406444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:01,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:01,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:01,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909577122] [2025-01-09 21:23:01,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:01,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:01,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:01,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:01,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:02,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2025-01-09 21:23:02,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 300 transitions, 1243 flow. Second operand has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 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:23:02,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:02,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2025-01-09 21:23:02,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:02,564 INFO L124 PetriNetUnfolderBase]: 754/2786 cut-off events. [2025-01-09 21:23:02,565 INFO L125 PetriNetUnfolderBase]: For 1613/1665 co-relation queries the response was YES. [2025-01-09 21:23:02,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6544 conditions, 2786 events. 754/2786 cut-off events. For 1613/1665 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19688 event pairs, 86 based on Foata normal form. 0/2692 useless extension candidates. Maximal degree in co-relation 6468. Up to 1009 conditions per place. [2025-01-09 21:23:02,578 INFO L140 encePairwiseOnDemand]: 176/199 looper letters, 128 selfloop transitions, 136 changer transitions 4/440 dead transitions. [2025-01-09 21:23:02,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 440 transitions, 2535 flow [2025-01-09 21:23:02,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1018 transitions. [2025-01-09 21:23:02,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8525963149078727 [2025-01-09 21:23:02,581 INFO L175 Difference]: Start difference. First operand has 210 places, 300 transitions, 1243 flow. Second operand 6 states and 1018 transitions. [2025-01-09 21:23:02,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 440 transitions, 2535 flow [2025-01-09 21:23:02,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 440 transitions, 2517 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:02,598 INFO L231 Difference]: Finished difference. Result has 220 places, 431 transitions, 2591 flow [2025-01-09 21:23:02,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2591, PETRI_PLACES=220, PETRI_TRANSITIONS=431} [2025-01-09 21:23:02,600 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 18 predicate places. [2025-01-09 21:23:02,601 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 431 transitions, 2591 flow [2025-01-09 21:23:02,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 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:23:02,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:02,602 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] [2025-01-09 21:23:02,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:23:02,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash -855917372, now seen corresponding path program 1 times [2025-01-09 21:23:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678253125] [2025-01-09 21:23:02,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:02,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:23:02,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:23:02,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:02,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:03,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678253125] [2025-01-09 21:23:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678253125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:03,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:03,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175489460] [2025-01-09 21:23:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:03,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:03,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:03,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:04,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-01-09 21:23:04,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 431 transitions, 2591 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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:23:04,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:04,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-01-09 21:23:04,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:05,261 INFO L124 PetriNetUnfolderBase]: 1151/4146 cut-off events. [2025-01-09 21:23:05,261 INFO L125 PetriNetUnfolderBase]: For 5339/5438 co-relation queries the response was YES. [2025-01-09 21:23:05,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11912 conditions, 4146 events. 1151/4146 cut-off events. For 5339/5438 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 33236 event pairs, 94 based on Foata normal form. 35/4083 useless extension candidates. Maximal degree in co-relation 11828. Up to 880 conditions per place. [2025-01-09 21:23:05,287 INFO L140 encePairwiseOnDemand]: 162/199 looper letters, 349 selfloop transitions, 159 changer transitions 4/655 dead transitions. [2025-01-09 21:23:05,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 655 transitions, 5031 flow [2025-01-09 21:23:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:23:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:23:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2077 transitions. [2025-01-09 21:23:05,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7455132806891601 [2025-01-09 21:23:05,291 INFO L175 Difference]: Start difference. First operand has 220 places, 431 transitions, 2591 flow. Second operand 14 states and 2077 transitions. [2025-01-09 21:23:05,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 655 transitions, 5031 flow [2025-01-09 21:23:05,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 655 transitions, 4959 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:05,318 INFO L231 Difference]: Finished difference. Result has 243 places, 494 transitions, 3864 flow [2025-01-09 21:23:05,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3864, PETRI_PLACES=243, PETRI_TRANSITIONS=494} [2025-01-09 21:23:05,320 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 41 predicate places. [2025-01-09 21:23:05,321 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 494 transitions, 3864 flow [2025-01-09 21:23:05,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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:23:05,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:05,322 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] [2025-01-09 21:23:05,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:23:05,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:05,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1426410300, now seen corresponding path program 2 times [2025-01-09 21:23:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:05,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713282864] [2025-01-09 21:23:05,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:05,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-01-09 21:23:05,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 112 of 114 statements. [2025-01-09 21:23:05,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:05,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:05,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713282864] [2025-01-09 21:23:05,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713282864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:05,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:05,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:05,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321627887] [2025-01-09 21:23:05,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:05,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:05,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:05,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:05,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:06,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-01-09 21:23:06,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 494 transitions, 3864 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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:23:06,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:06,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-01-09 21:23:06,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:07,809 INFO L124 PetriNetUnfolderBase]: 1263/4513 cut-off events. [2025-01-09 21:23:07,809 INFO L125 PetriNetUnfolderBase]: For 9507/9604 co-relation queries the response was YES. [2025-01-09 21:23:07,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14418 conditions, 4513 events. 1263/4513 cut-off events. For 9507/9604 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 36339 event pairs, 93 based on Foata normal form. 39/4430 useless extension candidates. Maximal degree in co-relation 14320. Up to 891 conditions per place. [2025-01-09 21:23:07,834 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 440 selfloop transitions, 103 changer transitions 0/686 dead transitions. [2025-01-09 21:23:07,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 686 transitions, 6408 flow [2025-01-09 21:23:07,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:23:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:23:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2654 transitions. [2025-01-09 21:23:07,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.701930706162391 [2025-01-09 21:23:07,839 INFO L175 Difference]: Start difference. First operand has 243 places, 494 transitions, 3864 flow. Second operand 19 states and 2654 transitions. [2025-01-09 21:23:07,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 686 transitions, 6408 flow [2025-01-09 21:23:07,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 686 transitions, 6403 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:23:07,868 INFO L231 Difference]: Finished difference. Result has 267 places, 549 transitions, 4679 flow [2025-01-09 21:23:07,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4679, PETRI_PLACES=267, PETRI_TRANSITIONS=549} [2025-01-09 21:23:07,869 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 65 predicate places. [2025-01-09 21:23:07,869 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 549 transitions, 4679 flow [2025-01-09 21:23:07,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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:23:07,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:07,874 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] [2025-01-09 21:23:07,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:23:07,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:07,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1131412442, now seen corresponding path program 3 times [2025-01-09 21:23:07,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:07,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819708239] [2025-01-09 21:23:07,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:07,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 2 equivalence classes. [2025-01-09 21:23:07,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 112 of 114 statements. [2025-01-09 21:23:07,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:07,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819708239] [2025-01-09 21:23:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819708239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440057847] [2025-01-09 21:23:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:08,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:08,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:08,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:09,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-01-09 21:23:09,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 549 transitions, 4679 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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:23:09,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:09,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-01-09 21:23:09,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:10,396 INFO L124 PetriNetUnfolderBase]: 1757/6357 cut-off events. [2025-01-09 21:23:10,397 INFO L125 PetriNetUnfolderBase]: For 18243/18448 co-relation queries the response was YES. [2025-01-09 21:23:10,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21506 conditions, 6357 events. 1757/6357 cut-off events. For 18243/18448 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 58019 event pairs, 162 based on Foata normal form. 49/6247 useless extension candidates. Maximal degree in co-relation 21398. Up to 1877 conditions per place. [2025-01-09 21:23:10,428 INFO L140 encePairwiseOnDemand]: 166/199 looper letters, 417 selfloop transitions, 204 changer transitions 1/765 dead transitions. [2025-01-09 21:23:10,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 765 transitions, 8082 flow [2025-01-09 21:23:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:23:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:23:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2111 transitions. [2025-01-09 21:23:10,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7072026800670017 [2025-01-09 21:23:10,431 INFO L175 Difference]: Start difference. First operand has 267 places, 549 transitions, 4679 flow. Second operand 15 states and 2111 transitions. [2025-01-09 21:23:10,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 765 transitions, 8082 flow [2025-01-09 21:23:10,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 765 transitions, 8041 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:10,483 INFO L231 Difference]: Finished difference. Result has 286 places, 653 transitions, 6958 flow [2025-01-09 21:23:10,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6958, PETRI_PLACES=286, PETRI_TRANSITIONS=653} [2025-01-09 21:23:10,484 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 84 predicate places. [2025-01-09 21:23:10,484 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 653 transitions, 6958 flow [2025-01-09 21:23:10,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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:23:10,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:10,485 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] [2025-01-09 21:23:10,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:23:10,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:10,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash 684030540, now seen corresponding path program 4 times [2025-01-09 21:23:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114269196] [2025-01-09 21:23:10,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:10,500 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-01-09 21:23:10,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 114 statements. [2025-01-09 21:23:10,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:23:10,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114269196] [2025-01-09 21:23:10,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114269196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:10,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:10,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:10,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114568683] [2025-01-09 21:23:10,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:10,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:10,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:10,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:12,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-01-09 21:23:12,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 653 transitions, 6958 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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:23:12,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:12,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-01-09 21:23:12,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:13,928 INFO L124 PetriNetUnfolderBase]: 2402/8635 cut-off events. [2025-01-09 21:23:13,929 INFO L125 PetriNetUnfolderBase]: For 36117/36411 co-relation queries the response was YES. [2025-01-09 21:23:13,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31298 conditions, 8635 events. 2402/8635 cut-off events. For 36117/36411 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 85334 event pairs, 231 based on Foata normal form. 82/8516 useless extension candidates. Maximal degree in co-relation 31179. Up to 1704 conditions per place. [2025-01-09 21:23:13,982 INFO L140 encePairwiseOnDemand]: 164/199 looper letters, 511 selfloop transitions, 329 changer transitions 2/985 dead transitions. [2025-01-09 21:23:13,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 985 transitions, 12297 flow [2025-01-09 21:23:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:23:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:23:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2718 transitions. [2025-01-09 21:23:13,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7188574451203386 [2025-01-09 21:23:13,988 INFO L175 Difference]: Start difference. First operand has 286 places, 653 transitions, 6958 flow. Second operand 19 states and 2718 transitions. [2025-01-09 21:23:13,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 985 transitions, 12297 flow [2025-01-09 21:23:14,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 985 transitions, 12270 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-01-09 21:23:14,085 INFO L231 Difference]: Finished difference. Result has 316 places, 787 transitions, 10473 flow [2025-01-09 21:23:14,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=6931, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10473, PETRI_PLACES=316, PETRI_TRANSITIONS=787} [2025-01-09 21:23:14,087 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 114 predicate places. [2025-01-09 21:23:14,087 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 787 transitions, 10473 flow [2025-01-09 21:23:14,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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:23:14,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:14,088 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] [2025-01-09 21:23:14,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:23:14,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:14,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash 18221423, now seen corresponding path program 1 times [2025-01-09 21:23:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:14,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30113634] [2025-01-09 21:23:14,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:14,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:23:14,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:23:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30113634] [2025-01-09 21:23:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30113634] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686192447] [2025-01-09 21:23:14,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:14,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:14,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:14,515 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:23:14,516 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:23:14,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:23:14,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:23:14,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:14,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:14,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 21:23:14,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 21:23:14,770 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:23:14,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:23:14,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:23:14,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 21:23:14,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:14,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-01-09 21:23:14,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:14,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-01-09 21:23:14,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-01-09 21:23:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:14,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:14,911 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1020 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1020) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1020 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1020) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1020 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1020) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1020) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1))))) is different from false [2025-01-09 21:23:14,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1020 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1020) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1020) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1020) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1020 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1020) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))))) is different from false [2025-01-09 21:23:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:22,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686192447] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:23:22,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:23:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-01-09 21:23:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811610365] [2025-01-09 21:23:22,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:23:22,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:23:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:22,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:23:22,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=190, Unknown=9, NotChecked=58, Total=306 [2025-01-09 21:23:23,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 199 [2025-01-09 21:23:23,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 787 transitions, 10473 flow. Second operand has 18 states, 18 states have (on average 98.5) internal successors, (1773), 18 states have internal predecessors, (1773), 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:23:23,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:23,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 199 [2025-01-09 21:23:23,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:26,581 INFO L124 PetriNetUnfolderBase]: 4686/13068 cut-off events. [2025-01-09 21:23:26,581 INFO L125 PetriNetUnfolderBase]: For 66182/66420 co-relation queries the response was YES. [2025-01-09 21:23:26,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51701 conditions, 13068 events. 4686/13068 cut-off events. For 66182/66420 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 124316 event pairs, 1219 based on Foata normal form. 78/12818 useless extension candidates. Maximal degree in co-relation 51560. Up to 4099 conditions per place. [2025-01-09 21:23:26,692 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 724 selfloop transitions, 179 changer transitions 0/990 dead transitions. [2025-01-09 21:23:26,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 990 transitions, 14575 flow [2025-01-09 21:23:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:23:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:23:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1559 transitions. [2025-01-09 21:23:26,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595836324479541 [2025-01-09 21:23:26,694 INFO L175 Difference]: Start difference. First operand has 316 places, 787 transitions, 10473 flow. Second operand 14 states and 1559 transitions. [2025-01-09 21:23:26,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 990 transitions, 14575 flow [2025-01-09 21:23:26,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 990 transitions, 14492 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-01-09 21:23:26,913 INFO L231 Difference]: Finished difference. Result has 331 places, 802 transitions, 11222 flow [2025-01-09 21:23:26,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=10406, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=11222, PETRI_PLACES=331, PETRI_TRANSITIONS=802} [2025-01-09 21:23:26,914 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 129 predicate places. [2025-01-09 21:23:26,914 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 802 transitions, 11222 flow [2025-01-09 21:23:26,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 98.5) internal successors, (1773), 18 states have internal predecessors, (1773), 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:23:26,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:26,915 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] [2025-01-09 21:23:26,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:23:27,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 21:23:27,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:27,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1014948686, now seen corresponding path program 5 times [2025-01-09 21:23:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:27,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910344908] [2025-01-09 21:23:27,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:27,152 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-01-09 21:23:27,161 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:23:27,162 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:23:27,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910344908] [2025-01-09 21:23:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910344908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509655637] [2025-01-09 21:23:27,768 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:27,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:27,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:27,770 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:23:27,772 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:23:27,864 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-01-09 21:23:27,974 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:23:27,974 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:23:27,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:27,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 21:23:27,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:28,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:23:28,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 21:23:28,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-09 21:23:28,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:28,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-01-09 21:23:28,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:28,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:28,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:28,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:28,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:28,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2025-01-09 21:23:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:28,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:34,872 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:23:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:35,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509655637] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:23:35,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:23:35,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 34 [2025-01-09 21:23:35,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914480915] [2025-01-09 21:23:35,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:23:35,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 21:23:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:35,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 21:23:35,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1040, Unknown=1, NotChecked=0, Total=1190 [2025-01-09 21:23:39,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:23:42,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:23:46,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:23:51,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:23:55,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:00,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:04,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:08,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:13,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:18,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:22,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:27,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:31,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]