./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c --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/weaver/popl20-horseshoe.wvr.c -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 ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:08,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:08,668 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:33:08,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:08,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:08,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:08,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:08,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:08,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:08,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:08,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:08,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:08,700 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:08,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:08,701 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:08,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:08,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:08,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:08,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:08,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:08,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:08,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:08,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:08,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:08,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:08,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:08,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:08,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:08,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:08,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:08,704 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 -> ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d [2025-01-09 21:33:08,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:08,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:08,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:08,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:08,968 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:08,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2025-01-09 21:33:10,220 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc35aeb7/f045d6cd11ac4ed88f4e48fae19646d5/FLAG7567b8a01 [2025-01-09 21:33:10,507 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:10,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2025-01-09 21:33:10,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc35aeb7/f045d6cd11ac4ed88f4e48fae19646d5/FLAG7567b8a01 [2025-01-09 21:33:10,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc35aeb7/f045d6cd11ac4ed88f4e48fae19646d5 [2025-01-09 21:33:10,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:10,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:10,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:10,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:10,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:10,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:10" (1/1) ... [2025-01-09 21:33:10,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ddd863d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:10, skipping insertion in model container [2025-01-09 21:33:10,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:10" (1/1) ... [2025-01-09 21:33:10,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:11,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:11,043 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:11,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:11,077 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:11,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11 WrapperNode [2025-01-09 21:33:11,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:11,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:11,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:11,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:11,082 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:33:11" (1/1) ... [2025-01-09 21:33:11,089 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:33:11" (1/1) ... [2025-01-09 21:33:11,110 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 447 [2025-01-09 21:33:11,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:11,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:11,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:11,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:11,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:11,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:11,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:11,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:11,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (1/1) ... [2025-01-09 21:33:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:11,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:11,167 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:33:11,172 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:33:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:11,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:11,201 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:33:11,279 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:11,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:11,702 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:11,702 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:11,988 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:11,989 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:11,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:11 BoogieIcfgContainer [2025-01-09 21:33:11,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:11,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:11,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:11,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:11,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:10" (1/3) ... [2025-01-09 21:33:11,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:11, skipping insertion in model container [2025-01-09 21:33:11,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:11" (2/3) ... [2025-01-09 21:33:11,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:11, skipping insertion in model container [2025-01-09 21:33:11,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:11" (3/3) ... [2025-01-09 21:33:11,999 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2025-01-09 21:33:12,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:12,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-horseshoe.wvr.c that has 4 procedures, 336 locations, 1 initial locations, 5 loop locations, and 67 error locations. [2025-01-09 21:33:12,012 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:12,146 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:12,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 345 places, 349 transitions, 719 flow [2025-01-09 21:33:12,279 INFO L124 PetriNetUnfolderBase]: 14/346 cut-off events. [2025-01-09 21:33:12,280 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:12,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 346 events. 14/346 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 512 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 295. Up to 2 conditions per place. [2025-01-09 21:33:12,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 349 transitions, 719 flow [2025-01-09 21:33:12,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 329 transitions, 676 flow [2025-01-09 21:33:12,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:12,303 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;@615281da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:12,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2025-01-09 21:33:12,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:12,308 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-01-09 21:33:12,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:12,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:12,309 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] [2025-01-09 21:33:12,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:12,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash -881592254, now seen corresponding path program 1 times [2025-01-09 21:33:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347195611] [2025-01-09 21:33:12,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:33:12,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:33:12,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:12,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:12,455 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:33:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:12,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347195611] [2025-01-09 21:33:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347195611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:12,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:12,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326993479] [2025-01-09 21:33:12,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:12,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:12,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:12,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:12,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-01-09 21:33:12,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 329 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:12,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:12,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-01-09 21:33:12,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:12,698 INFO L124 PetriNetUnfolderBase]: 55/515 cut-off events. [2025-01-09 21:33:12,699 INFO L125 PetriNetUnfolderBase]: For 39/40 co-relation queries the response was YES. [2025-01-09 21:33:12,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 515 events. 55/515 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1742 event pairs, 38 based on Foata normal form. 15/459 useless extension candidates. Maximal degree in co-relation 361. Up to 90 conditions per place. [2025-01-09 21:33:12,705 INFO L140 encePairwiseOnDemand]: 294/349 looper letters, 15 selfloop transitions, 2 changer transitions 5/276 dead transitions. [2025-01-09 21:33:12,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 276 transitions, 604 flow [2025-01-09 21:33:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-01-09 21:33:12,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8576886341929322 [2025-01-09 21:33:12,722 INFO L175 Difference]: Start difference. First operand has 326 places, 329 transitions, 676 flow. Second operand 3 states and 898 transitions. [2025-01-09 21:33:12,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 276 transitions, 604 flow [2025-01-09 21:33:12,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 276 transitions, 592 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:12,733 INFO L231 Difference]: Finished difference. Result has 277 places, 271 transitions, 552 flow [2025-01-09 21:33:12,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=277, PETRI_TRANSITIONS=271} [2025-01-09 21:33:12,738 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -49 predicate places. [2025-01-09 21:33:12,738 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 271 transitions, 552 flow [2025-01-09 21:33:12,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:12,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:12,739 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] [2025-01-09 21:33:12,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:12,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:12,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2037710142, now seen corresponding path program 1 times [2025-01-09 21:33:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861168912] [2025-01-09 21:33:12,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:12,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:33:12,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:33:12,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:12,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:12,808 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:33:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:12,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861168912] [2025-01-09 21:33:12,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861168912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:12,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:12,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:12,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598595468] [2025-01-09 21:33:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:12,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:12,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:12,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:12,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:33:12,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:12,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:12,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:33:12,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:12,921 INFO L124 PetriNetUnfolderBase]: 55/525 cut-off events. [2025-01-09 21:33:12,921 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:33:12,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 525 events. 55/525 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1828 event pairs, 7 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 598. Up to 69 conditions per place. [2025-01-09 21:33:12,924 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 18 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-01-09 21:33:12,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 276 transitions, 604 flow [2025-01-09 21:33:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-01-09 21:33:12,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8223495702005731 [2025-01-09 21:33:12,927 INFO L175 Difference]: Start difference. First operand has 277 places, 271 transitions, 552 flow. Second operand 3 states and 861 transitions. [2025-01-09 21:33:12,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 276 transitions, 604 flow [2025-01-09 21:33:12,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 276 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:12,931 INFO L231 Difference]: Finished difference. Result has 272 places, 271 transitions, 556 flow [2025-01-09 21:33:12,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=272, PETRI_TRANSITIONS=271} [2025-01-09 21:33:12,932 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -54 predicate places. [2025-01-09 21:33:12,932 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 271 transitions, 556 flow [2025-01-09 21:33:12,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:12,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:12,933 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] [2025-01-09 21:33:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:12,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1915643984, now seen corresponding path program 1 times [2025-01-09 21:33:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521088101] [2025-01-09 21:33:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:12,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:33:12,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:33:12,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:12,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:12,960 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:33:12,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:12,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521088101] [2025-01-09 21:33:12,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521088101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:12,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:12,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268816127] [2025-01-09 21:33:12,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:12,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:12,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:12,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:12,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:12,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:12,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 271 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 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:33:12,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:12,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:12,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,071 INFO L124 PetriNetUnfolderBase]: 55/511 cut-off events. [2025-01-09 21:33:13,071 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2025-01-09 21:33:13,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 511 events. 55/511 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1772 event pairs, 38 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 310. Up to 92 conditions per place. [2025-01-09 21:33:13,074 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 15 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-01-09 21:33:13,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 270 transitions, 588 flow [2025-01-09 21:33:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-01-09 21:33:13,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-01-09 21:33:13,077 INFO L175 Difference]: Start difference. First operand has 272 places, 271 transitions, 556 flow. Second operand 3 states and 848 transitions. [2025-01-09 21:33:13,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 270 transitions, 588 flow [2025-01-09 21:33:13,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 270 transitions, 586 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:13,081 INFO L231 Difference]: Finished difference. Result has 272 places, 270 transitions, 556 flow [2025-01-09 21:33:13,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=272, PETRI_TRANSITIONS=270} [2025-01-09 21:33:13,082 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -54 predicate places. [2025-01-09 21:33:13,082 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 270 transitions, 556 flow [2025-01-09 21:33:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 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:33:13,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,083 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] [2025-01-09 21:33:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:13,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1613529663, now seen corresponding path program 1 times [2025-01-09 21:33:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497775774] [2025-01-09 21:33:13,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:33:13,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:33:13,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:13,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:13,115 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:33:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497775774] [2025-01-09 21:33:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497775774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395070033] [2025-01-09 21:33:13,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:13,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:13,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:13,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:13,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:13,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-01-09 21:33:13,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 270 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:13,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:13,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-01-09 21:33:13,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,220 INFO L124 PetriNetUnfolderBase]: 55/510 cut-off events. [2025-01-09 21:33:13,220 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-01-09 21:33:13,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 510 events. 55/510 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1772 event pairs, 38 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 601. Up to 93 conditions per place. [2025-01-09 21:33:13,223 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 16 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-01-09 21:33:13,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 269 transitions, 590 flow [2025-01-09 21:33:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-01-09 21:33:13,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8080229226361032 [2025-01-09 21:33:13,225 INFO L175 Difference]: Start difference. First operand has 272 places, 270 transitions, 556 flow. Second operand 3 states and 846 transitions. [2025-01-09 21:33:13,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 269 transitions, 590 flow [2025-01-09 21:33:13,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 269 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:13,229 INFO L231 Difference]: Finished difference. Result has 271 places, 269 transitions, 554 flow [2025-01-09 21:33:13,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=271, PETRI_TRANSITIONS=269} [2025-01-09 21:33:13,230 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -55 predicate places. [2025-01-09 21:33:13,230 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 269 transitions, 554 flow [2025-01-09 21:33:13,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:13,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,231 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] [2025-01-09 21:33:13,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:13,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:13,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1744768360, now seen corresponding path program 1 times [2025-01-09 21:33:13,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755277633] [2025-01-09 21:33:13,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:33:13,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:33:13,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:13,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:13,262 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:33:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755277633] [2025-01-09 21:33:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755277633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689803923] [2025-01-09 21:33:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:13,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:13,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:13,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:33:13,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 269 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:13,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:13,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:33:13,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,380 INFO L124 PetriNetUnfolderBase]: 65/600 cut-off events. [2025-01-09 21:33:13,380 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:33:13,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 600 events. 65/600 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2395 event pairs, 20 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 693. Up to 54 conditions per place. [2025-01-09 21:33:13,383 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 21 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-01-09 21:33:13,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 276 transitions, 620 flow [2025-01-09 21:33:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-01-09 21:33:13,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8233046800382043 [2025-01-09 21:33:13,386 INFO L175 Difference]: Start difference. First operand has 271 places, 269 transitions, 554 flow. Second operand 3 states and 862 transitions. [2025-01-09 21:33:13,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 276 transitions, 620 flow [2025-01-09 21:33:13,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 276 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:13,390 INFO L231 Difference]: Finished difference. Result has 271 places, 269 transitions, 558 flow [2025-01-09 21:33:13,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=271, PETRI_TRANSITIONS=269} [2025-01-09 21:33:13,391 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -55 predicate places. [2025-01-09 21:33:13,391 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 269 transitions, 558 flow [2025-01-09 21:33:13,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:13,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,392 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] [2025-01-09 21:33:13,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:13,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:13,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash -179996696, now seen corresponding path program 1 times [2025-01-09 21:33:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707235884] [2025-01-09 21:33:13,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:33:13,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:33:13,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:13,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:13,422 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:33:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707235884] [2025-01-09 21:33:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707235884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:13,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:13,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813701277] [2025-01-09 21:33:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:13,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:13,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:13,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:13,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:13,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 269 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 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:33:13,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:13,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:13,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,527 INFO L124 PetriNetUnfolderBase]: 65/521 cut-off events. [2025-01-09 21:33:13,528 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2025-01-09 21:33:13,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 521 events. 65/521 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1821 event pairs, 38 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 426. Up to 105 conditions per place. [2025-01-09 21:33:13,531 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 16 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-01-09 21:33:13,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 268 transitions, 592 flow [2025-01-09 21:33:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-01-09 21:33:13,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-01-09 21:33:13,533 INFO L175 Difference]: Start difference. First operand has 271 places, 269 transitions, 558 flow. Second operand 3 states and 848 transitions. [2025-01-09 21:33:13,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 268 transitions, 592 flow [2025-01-09 21:33:13,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 268 transitions, 590 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:13,537 INFO L231 Difference]: Finished difference. Result has 271 places, 268 transitions, 558 flow [2025-01-09 21:33:13,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=271, PETRI_TRANSITIONS=268} [2025-01-09 21:33:13,538 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -55 predicate places. [2025-01-09 21:33:13,538 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 268 transitions, 558 flow [2025-01-09 21:33:13,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 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:33:13,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,539 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] [2025-01-09 21:33:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:13,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:13,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash 738223988, now seen corresponding path program 1 times [2025-01-09 21:33:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896524247] [2025-01-09 21:33:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:33:13,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:33:13,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:13,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:13,574 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:33:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:13,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896524247] [2025-01-09 21:33:13,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896524247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:13,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:13,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610916258] [2025-01-09 21:33:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:13,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:13,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:13,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:13,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:13,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-01-09 21:33:13,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 268 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:13,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:13,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-01-09 21:33:13,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,683 INFO L124 PetriNetUnfolderBase]: 65/520 cut-off events. [2025-01-09 21:33:13,684 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:13,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 520 events. 65/520 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1804 event pairs, 38 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 635. Up to 106 conditions per place. [2025-01-09 21:33:13,686 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 17 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-01-09 21:33:13,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 267 transitions, 594 flow [2025-01-09 21:33:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-01-09 21:33:13,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8080229226361032 [2025-01-09 21:33:13,688 INFO L175 Difference]: Start difference. First operand has 271 places, 268 transitions, 558 flow. Second operand 3 states and 846 transitions. [2025-01-09 21:33:13,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 267 transitions, 594 flow [2025-01-09 21:33:13,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 267 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:13,691 INFO L231 Difference]: Finished difference. Result has 270 places, 267 transitions, 556 flow [2025-01-09 21:33:13,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=270, PETRI_TRANSITIONS=267} [2025-01-09 21:33:13,692 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -56 predicate places. [2025-01-09 21:33:13,692 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 267 transitions, 556 flow [2025-01-09 21:33:13,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:13,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,693 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] [2025-01-09 21:33:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:13,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash -536086719, now seen corresponding path program 1 times [2025-01-09 21:33:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625321437] [2025-01-09 21:33:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:33:13,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:33:13,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:13,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:13,723 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:33:13,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625321437] [2025-01-09 21:33:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625321437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:13,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:13,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012556024] [2025-01-09 21:33:13,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:13,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:13,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:13,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:13,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:33:13,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 267 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:13,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:13,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:33:13,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,793 INFO L124 PetriNetUnfolderBase]: 65/519 cut-off events. [2025-01-09 21:33:13,793 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2025-01-09 21:33:13,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 519 events. 65/519 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1806 event pairs, 38 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 623. Up to 103 conditions per place. [2025-01-09 21:33:13,796 INFO L140 encePairwiseOnDemand]: 347/349 looper letters, 15 selfloop transitions, 1 changer transitions 0/266 dead transitions. [2025-01-09 21:33:13,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 266 transitions, 586 flow [2025-01-09 21:33:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:33:13,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166189111747851 [2025-01-09 21:33:13,798 INFO L175 Difference]: Start difference. First operand has 270 places, 267 transitions, 556 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:33:13,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 266 transitions, 586 flow [2025-01-09 21:33:13,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 266 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:13,801 INFO L231 Difference]: Finished difference. Result has 269 places, 266 transitions, 552 flow [2025-01-09 21:33:13,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=269, PETRI_TRANSITIONS=266} [2025-01-09 21:33:13,801 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -57 predicate places. [2025-01-09 21:33:13,801 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 266 transitions, 552 flow [2025-01-09 21:33:13,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:13,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:13,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:13,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:13,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1699100654, now seen corresponding path program 1 times [2025-01-09 21:33:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974422582] [2025-01-09 21:33:13,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:33:13,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:33:13,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:13,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:13,888 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:33:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:13,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974422582] [2025-01-09 21:33:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974422582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:13,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746906397] [2025-01-09 21:33:13,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:13,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:13,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:13,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:13,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 266 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 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:33:13,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:13,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:13,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,966 INFO L124 PetriNetUnfolderBase]: 65/518 cut-off events. [2025-01-09 21:33:13,966 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:13,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 518 events. 65/518 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1792 event pairs, 38 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 623. Up to 105 conditions per place. [2025-01-09 21:33:13,968 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 16 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-01-09 21:33:13,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 265 transitions, 586 flow [2025-01-09 21:33:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-01-09 21:33:13,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-01-09 21:33:13,970 INFO L175 Difference]: Start difference. First operand has 269 places, 266 transitions, 552 flow. Second operand 3 states and 848 transitions. [2025-01-09 21:33:13,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 265 transitions, 586 flow [2025-01-09 21:33:13,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 265 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:13,973 INFO L231 Difference]: Finished difference. Result has 269 places, 265 transitions, 553 flow [2025-01-09 21:33:13,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=269, PETRI_TRANSITIONS=265} [2025-01-09 21:33:13,974 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -57 predicate places. [2025-01-09 21:33:13,974 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 265 transitions, 553 flow [2025-01-09 21:33:13,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 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:33:13,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:13,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:13,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:13,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2083751502, now seen corresponding path program 1 times [2025-01-09 21:33:13,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515205509] [2025-01-09 21:33:13,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:33:14,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:33:14,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:14,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:14,376 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:33:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515205509] [2025-01-09 21:33:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515205509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749462851] [2025-01-09 21:33:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:14,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:14,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:14,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:14,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:14,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 349 [2025-01-09 21:33:14,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 265 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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:33:14,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:14,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 349 [2025-01-09 21:33:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:14,606 INFO L124 PetriNetUnfolderBase]: 65/516 cut-off events. [2025-01-09 21:33:14,606 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:14,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 516 events. 65/516 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1797 event pairs, 38 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 645. Up to 118 conditions per place. [2025-01-09 21:33:14,608 INFO L140 encePairwiseOnDemand]: 337/349 looper letters, 29 selfloop transitions, 10 changer transitions 0/263 dead transitions. [2025-01-09 21:33:14,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 263 transitions, 627 flow [2025-01-09 21:33:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1575 transitions. [2025-01-09 21:33:14,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521489971346705 [2025-01-09 21:33:14,611 INFO L175 Difference]: Start difference. First operand has 269 places, 265 transitions, 553 flow. Second operand 6 states and 1575 transitions. [2025-01-09 21:33:14,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 263 transitions, 627 flow [2025-01-09 21:33:14,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 263 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:14,616 INFO L231 Difference]: Finished difference. Result has 270 places, 263 transitions, 565 flow [2025-01-09 21:33:14,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=565, PETRI_PLACES=270, PETRI_TRANSITIONS=263} [2025-01-09 21:33:14,617 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -56 predicate places. [2025-01-09 21:33:14,617 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 263 transitions, 565 flow [2025-01-09 21:33:14,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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:33:14,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:14,618 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] [2025-01-09 21:33:14,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:14,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:14,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1050462672, now seen corresponding path program 1 times [2025-01-09 21:33:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536385425] [2025-01-09 21:33:14,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:14,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:33:14,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:33:14,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:14,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:14,669 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:33:14,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:14,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536385425] [2025-01-09 21:33:14,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536385425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:14,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:14,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225316541] [2025-01-09 21:33:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:14,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:14,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:14,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:14,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:14,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-01-09 21:33:14,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 263 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:14,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:14,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-01-09 21:33:14,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:14,743 INFO L124 PetriNetUnfolderBase]: 65/515 cut-off events. [2025-01-09 21:33:14,743 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:14,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 515 events. 65/515 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1795 event pairs, 38 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 666. Up to 106 conditions per place. [2025-01-09 21:33:14,745 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 17 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-01-09 21:33:14,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 262 transitions, 601 flow [2025-01-09 21:33:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-01-09 21:33:14,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8080229226361032 [2025-01-09 21:33:14,746 INFO L175 Difference]: Start difference. First operand has 270 places, 263 transitions, 565 flow. Second operand 3 states and 846 transitions. [2025-01-09 21:33:14,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 262 transitions, 601 flow [2025-01-09 21:33:14,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 581 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:14,750 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 547 flow [2025-01-09 21:33:14,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2025-01-09 21:33:14,751 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -60 predicate places. [2025-01-09 21:33:14,751 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 547 flow [2025-01-09 21:33:14,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:14,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:14,751 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] [2025-01-09 21:33:14,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:14,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:14,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1360471878, now seen corresponding path program 1 times [2025-01-09 21:33:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:14,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767761391] [2025-01-09 21:33:14,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:33:14,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:33:14,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:14,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:14,786 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:33:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767761391] [2025-01-09 21:33:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767761391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641908311] [2025-01-09 21:33:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:14,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:14,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:14,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:14,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:33:14,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:14,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:14,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:33:14,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:14,867 INFO L124 PetriNetUnfolderBase]: 65/514 cut-off events. [2025-01-09 21:33:14,868 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2025-01-09 21:33:14,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 514 events. 65/514 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1783 event pairs, 38 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 620. Up to 103 conditions per place. [2025-01-09 21:33:14,869 INFO L140 encePairwiseOnDemand]: 347/349 looper letters, 15 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2025-01-09 21:33:14,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 261 transitions, 577 flow [2025-01-09 21:33:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:33:14,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166189111747851 [2025-01-09 21:33:14,871 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 547 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:33:14,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 261 transitions, 577 flow [2025-01-09 21:33:14,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 261 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:14,874 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 543 flow [2025-01-09 21:33:14,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2025-01-09 21:33:14,876 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -61 predicate places. [2025-01-09 21:33:14,876 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 543 flow [2025-01-09 21:33:14,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:14,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:14,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:14,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:14,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:14,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2079028624, now seen corresponding path program 1 times [2025-01-09 21:33:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:14,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047338195] [2025-01-09 21:33:14,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:14,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:33:14,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:33:14,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:14,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:14,913 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:33:14,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:14,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047338195] [2025-01-09 21:33:14,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047338195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:14,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:14,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572447802] [2025-01-09 21:33:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:14,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:14,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:14,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:14,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:14,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 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:33:14,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:14,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:14,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:14,985 INFO L124 PetriNetUnfolderBase]: 65/513 cut-off events. [2025-01-09 21:33:14,985 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:14,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 513 events. 65/513 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1779 event pairs, 38 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 619. Up to 105 conditions per place. [2025-01-09 21:33:14,987 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 16 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2025-01-09 21:33:14,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 260 transitions, 577 flow [2025-01-09 21:33:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-01-09 21:33:14,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-01-09 21:33:14,989 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 543 flow. Second operand 3 states and 848 transitions. [2025-01-09 21:33:14,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 260 transitions, 577 flow [2025-01-09 21:33:14,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 260 transitions, 576 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:14,993 INFO L231 Difference]: Finished difference. Result has 265 places, 260 transitions, 544 flow [2025-01-09 21:33:14,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=265, PETRI_TRANSITIONS=260} [2025-01-09 21:33:14,993 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -61 predicate places. [2025-01-09 21:33:14,994 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 260 transitions, 544 flow [2025-01-09 21:33:14,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 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:33:14,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:14,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:14,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:14,996 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:14,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:14,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1854241308, now seen corresponding path program 1 times [2025-01-09 21:33:14,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:14,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513045484] [2025-01-09 21:33:14,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:14,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:15,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:33:15,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:33:15,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:15,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:15,031 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:33:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513045484] [2025-01-09 21:33:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513045484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804161550] [2025-01-09 21:33:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:15,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:15,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:15,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:15,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:15,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 349 [2025-01-09 21:33:15,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 260 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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:33:15,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:15,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 349 [2025-01-09 21:33:15,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:15,113 INFO L124 PetriNetUnfolderBase]: 93/593 cut-off events. [2025-01-09 21:33:15,114 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-09 21:33:15,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 593 events. 93/593 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2249 event pairs, 51 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 756. Up to 144 conditions per place. [2025-01-09 21:33:15,116 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 18 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-01-09 21:33:15,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 259 transitions, 582 flow [2025-01-09 21:33:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2025-01-09 21:33:15,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8061127029608405 [2025-01-09 21:33:15,119 INFO L175 Difference]: Start difference. First operand has 265 places, 260 transitions, 544 flow. Second operand 3 states and 844 transitions. [2025-01-09 21:33:15,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 259 transitions, 582 flow [2025-01-09 21:33:15,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 259 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:15,122 INFO L231 Difference]: Finished difference. Result has 264 places, 259 transitions, 542 flow [2025-01-09 21:33:15,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=264, PETRI_TRANSITIONS=259} [2025-01-09 21:33:15,124 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -62 predicate places. [2025-01-09 21:33:15,124 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 259 transitions, 542 flow [2025-01-09 21:33:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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:33:15,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:15,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:15,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:15,125 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:15,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1594219228, now seen corresponding path program 1 times [2025-01-09 21:33:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766144264] [2025-01-09 21:33:15,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:15,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:33:15,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:33:15,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:15,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:15,169 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:33:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766144264] [2025-01-09 21:33:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766144264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:15,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:15,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891521348] [2025-01-09 21:33:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:15,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:15,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:15,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:15,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:15,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 259 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 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:33:15,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:15,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:15,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:15,252 INFO L124 PetriNetUnfolderBase]: 112/650 cut-off events. [2025-01-09 21:33:15,252 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-09 21:33:15,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 650 events. 112/650 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2709 event pairs, 64 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 856. Up to 170 conditions per place. [2025-01-09 21:33:15,255 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 17 selfloop transitions, 1 changer transitions 0/257 dead transitions. [2025-01-09 21:33:15,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 257 transitions, 574 flow [2025-01-09 21:33:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2025-01-09 21:33:15,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8108882521489972 [2025-01-09 21:33:15,257 INFO L175 Difference]: Start difference. First operand has 264 places, 259 transitions, 542 flow. Second operand 3 states and 849 transitions. [2025-01-09 21:33:15,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 257 transitions, 574 flow [2025-01-09 21:33:15,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 257 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:15,261 INFO L231 Difference]: Finished difference. Result has 262 places, 257 transitions, 536 flow [2025-01-09 21:33:15,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=262, PETRI_TRANSITIONS=257} [2025-01-09 21:33:15,262 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -64 predicate places. [2025-01-09 21:33:15,262 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 257 transitions, 536 flow [2025-01-09 21:33:15,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 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:33:15,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:15,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:15,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:15,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:15,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash -414604041, now seen corresponding path program 1 times [2025-01-09 21:33:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:15,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111171635] [2025-01-09 21:33:15,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:15,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:33:15,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:33:15,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:15,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:15,346 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:33:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111171635] [2025-01-09 21:33:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111171635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:15,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:15,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:15,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099175585] [2025-01-09 21:33:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:15,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:15,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:15,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:15,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:15,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:15,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 257 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:33:15,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:15,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:15,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:15,486 INFO L124 PetriNetUnfolderBase]: 122/561 cut-off events. [2025-01-09 21:33:15,486 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2025-01-09 21:33:15,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 561 events. 122/561 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2099 event pairs, 53 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 789. Up to 132 conditions per place. [2025-01-09 21:33:15,489 INFO L140 encePairwiseOnDemand]: 344/349 looper letters, 21 selfloop transitions, 3 changer transitions 0/261 dead transitions. [2025-01-09 21:33:15,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 261 transitions, 598 flow [2025-01-09 21:33:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2025-01-09 21:33:15,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8156638013371538 [2025-01-09 21:33:15,491 INFO L175 Difference]: Start difference. First operand has 262 places, 257 transitions, 536 flow. Second operand 3 states and 854 transitions. [2025-01-09 21:33:15,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 261 transitions, 598 flow [2025-01-09 21:33:15,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 261 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:15,495 INFO L231 Difference]: Finished difference. Result has 261 places, 255 transitions, 537 flow [2025-01-09 21:33:15,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=261, PETRI_TRANSITIONS=255} [2025-01-09 21:33:15,495 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -65 predicate places. [2025-01-09 21:33:15,495 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 255 transitions, 537 flow [2025-01-09 21:33:15,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:33:15,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:15,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:15,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:15,496 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:15,497 INFO L85 PathProgramCache]: Analyzing trace with hash 844776058, now seen corresponding path program 1 times [2025-01-09 21:33:15,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:15,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318674935] [2025-01-09 21:33:15,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:15,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:33:15,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:33:15,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:15,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:15,556 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:33:15,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:15,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318674935] [2025-01-09 21:33:15,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318674935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:15,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:15,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:15,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806871032] [2025-01-09 21:33:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:15,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:15,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:15,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:15,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:15,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:15,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 255 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 279.6666666666667) internal successors, (839), 3 states have internal predecessors, (839), 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:33:15,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:15,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:15,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:15,647 INFO L124 PetriNetUnfolderBase]: 160/589 cut-off events. [2025-01-09 21:33:15,647 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-01-09 21:33:15,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 589 events. 160/589 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2250 event pairs, 83 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 921. Up to 193 conditions per place. [2025-01-09 21:33:15,650 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 23 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2025-01-09 21:33:15,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 260 transitions, 603 flow [2025-01-09 21:33:15,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2025-01-09 21:33:15,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8156638013371538 [2025-01-09 21:33:15,652 INFO L175 Difference]: Start difference. First operand has 261 places, 255 transitions, 537 flow. Second operand 3 states and 854 transitions. [2025-01-09 21:33:15,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 260 transitions, 603 flow [2025-01-09 21:33:15,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 260 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:15,655 INFO L231 Difference]: Finished difference. Result has 260 places, 254 transitions, 533 flow [2025-01-09 21:33:15,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=260, PETRI_TRANSITIONS=254} [2025-01-09 21:33:15,656 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -66 predicate places. [2025-01-09 21:33:15,656 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 254 transitions, 533 flow [2025-01-09 21:33:15,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.6666666666667) internal successors, (839), 3 states have internal predecessors, (839), 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:33:15,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:15,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:15,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:15,657 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:15,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash -495743935, now seen corresponding path program 1 times [2025-01-09 21:33:15,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:15,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698014900] [2025-01-09 21:33:15,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:15,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:15,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:33:15,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:33:15,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:15,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:15,703 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:33:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698014900] [2025-01-09 21:33:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698014900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:15,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489655406] [2025-01-09 21:33:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:15,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:15,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:15,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:15,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:15,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 254 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:33:15,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:15,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:15,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:15,795 INFO L124 PetriNetUnfolderBase]: 131/650 cut-off events. [2025-01-09 21:33:15,795 INFO L125 PetriNetUnfolderBase]: For 93/105 co-relation queries the response was YES. [2025-01-09 21:33:15,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 650 events. 131/650 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2735 event pairs, 56 based on Foata normal form. 1/601 useless extension candidates. Maximal degree in co-relation 903. Up to 137 conditions per place. [2025-01-09 21:33:15,798 INFO L140 encePairwiseOnDemand]: 344/349 looper letters, 20 selfloop transitions, 2 changer transitions 4/259 dead transitions. [2025-01-09 21:33:15,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 597 flow [2025-01-09 21:33:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2025-01-09 21:33:15,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8156638013371538 [2025-01-09 21:33:15,800 INFO L175 Difference]: Start difference. First operand has 260 places, 254 transitions, 533 flow. Second operand 3 states and 854 transitions. [2025-01-09 21:33:15,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 597 flow [2025-01-09 21:33:15,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 259 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:15,802 INFO L231 Difference]: Finished difference. Result has 258 places, 248 transitions, 520 flow [2025-01-09 21:33:15,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=258, PETRI_TRANSITIONS=248} [2025-01-09 21:33:15,803 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -68 predicate places. [2025-01-09 21:33:15,803 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 248 transitions, 520 flow [2025-01-09 21:33:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:33:15,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:15,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:33:15,804 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:15,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash 743973764, now seen corresponding path program 1 times [2025-01-09 21:33:15,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:15,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095933] [2025-01-09 21:33:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:15,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:33:15,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:33:15,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:15,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:15,860 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:33:15,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095933] [2025-01-09 21:33:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:15,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:15,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236278791] [2025-01-09 21:33:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:15,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:15,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:15,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:15,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:15,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 248 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 279.6666666666667) internal successors, (839), 3 states have internal predecessors, (839), 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:33:15,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:15,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:15,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:15,965 INFO L124 PetriNetUnfolderBase]: 175/674 cut-off events. [2025-01-09 21:33:15,965 INFO L125 PetriNetUnfolderBase]: For 129/155 co-relation queries the response was YES. [2025-01-09 21:33:15,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 674 events. 175/674 cut-off events. For 129/155 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2927 event pairs, 92 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 1017. Up to 206 conditions per place. [2025-01-09 21:33:15,967 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 0 selfloop transitions, 0 changer transitions 254/254 dead transitions. [2025-01-09 21:33:15,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 586 flow [2025-01-09 21:33:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-01-09 21:33:15,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8147086914995224 [2025-01-09 21:33:15,968 INFO L175 Difference]: Start difference. First operand has 258 places, 248 transitions, 520 flow. Second operand 3 states and 853 transitions. [2025-01-09 21:33:15,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 586 flow [2025-01-09 21:33:15,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:15,970 INFO L231 Difference]: Finished difference. Result has 253 places, 0 transitions, 0 flow [2025-01-09 21:33:15,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=253, PETRI_TRANSITIONS=0} [2025-01-09 21:33:15,971 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -73 predicate places. [2025-01-09 21:33:15,971 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 0 transitions, 0 flow [2025-01-09 21:33:15,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.6666666666667) internal successors, (839), 3 states have internal predecessors, (839), 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:33:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2025-01-09 21:33:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2025-01-09 21:33:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2025-01-09 21:33:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2025-01-09 21:33:15,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2025-01-09 21:33:15,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2025-01-09 21:33:15,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2025-01-09 21:33:15,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2025-01-09 21:33:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2025-01-09 21:33:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2025-01-09 21:33:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2025-01-09 21:33:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2025-01-09 21:33:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2025-01-09 21:33:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2025-01-09 21:33:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2025-01-09 21:33:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2025-01-09 21:33:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2025-01-09 21:33:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2025-01-09 21:33:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2025-01-09 21:33:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2025-01-09 21:33:15,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2025-01-09 21:33:15,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:33:15,985 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:15,991 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:15,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:15,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:15 BasicIcfg [2025-01-09 21:33:15,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:15,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:15,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:15,996 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:15,997 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:11" (3/4) ... [2025-01-09 21:33:15,998 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:16,000 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:16,000 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:16,000 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:16,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-09 21:33:16,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:16,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:16,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:16,075 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:16,075 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:16,076 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:16,076 INFO L158 Benchmark]: Toolchain (without parser) took 5274.86ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 107.3MB in the beginning and 277.8MB in the end (delta: -170.5MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2025-01-09 21:33:16,077 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:16,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.19ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 93.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:16,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.61ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:16,078 INFO L158 Benchmark]: Boogie Preprocessor took 28.01ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:16,078 INFO L158 Benchmark]: RCFGBuilder took 851.01ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 40.4MB in the end (delta: 47.7MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:16,078 INFO L158 Benchmark]: TraceAbstraction took 4003.49ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 39.7MB in the beginning and 286.2MB in the end (delta: -246.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2025-01-09 21:33:16,079 INFO L158 Benchmark]: Witness Printer took 79.49ms. Allocated memory is still 402.7MB. Free memory was 286.2MB in the beginning and 277.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:16,079 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.19ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 93.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.61ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.01ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 851.01ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 40.4MB in the end (delta: 47.7MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4003.49ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 39.7MB in the beginning and 286.2MB in the end (delta: -246.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 79.49ms. Allocated memory is still 402.7MB. Free memory was 286.2MB in the beginning and 277.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 431 locations, 119 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 757 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 50 mSDtfsCounter, 757 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1857 NumberOfCodeBlocks, 1857 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1838 ConstructedInterpolants, 0 QuantifiedInterpolants, 1989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:16,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE