./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.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-bad-ring-nondet.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 01186d000498d57447d1d7ea86dd893215c56febea2169abeb96f12030a58ea4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:51,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:51,840 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:32:51,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:51,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:51,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:51,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:51,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:51,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:51,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:51,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:51,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:51,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:51,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:51,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:51,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:51,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:51,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:51,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:51,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:51,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:51,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:51,861 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 -> 01186d000498d57447d1d7ea86dd893215c56febea2169abeb96f12030a58ea4 [2025-01-09 21:32:52,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:52,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:52,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:52,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:52,090 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:52,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c [2025-01-09 21:32:53,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e4f41f96/568519e8b35446b4adeac6ce98f41cfb/FLAG3a572b670 [2025-01-09 21:32:53,540 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:53,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c [2025-01-09 21:32:53,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e4f41f96/568519e8b35446b4adeac6ce98f41cfb/FLAG3a572b670 [2025-01-09 21:32:53,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e4f41f96/568519e8b35446b4adeac6ce98f41cfb [2025-01-09 21:32:53,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:53,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:53,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:53,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:53,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:53,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:53" (1/1) ... [2025-01-09 21:32:53,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4094456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:53, skipping insertion in model container [2025-01-09 21:32:53,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:53" (1/1) ... [2025-01-09 21:32:53,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:54,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:54,013 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:54,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:54,055 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:54,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54 WrapperNode [2025-01-09 21:32:54,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:54,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:54,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:54,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:54,061 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:32:54" (1/1) ... [2025-01-09 21:32:54,069 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:32:54" (1/1) ... [2025-01-09 21:32:54,099 INFO L138 Inliner]: procedures = 24, calls = 49, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 597 [2025-01-09 21:32:54,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:54,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:54,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:54,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:54,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,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:32:54" (1/1) ... [2025-01-09 21:32:54,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:54,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:54,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:54,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:54,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (1/1) ... [2025-01-09 21:32:54,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:54,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:54,174 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:32:54,176 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:32:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:54,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:54,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:54,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:32:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:32:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:32:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:32:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:54,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:32:54,198 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:32:54,307 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:54,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:54,964 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:54,965 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:55,342 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:55,342 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:32:55,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:55 BoogieIcfgContainer [2025-01-09 21:32:55,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:55,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:55,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:55,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:55,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:53" (1/3) ... [2025-01-09 21:32:55,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575d3c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:55, skipping insertion in model container [2025-01-09 21:32:55,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:54" (2/3) ... [2025-01-09 21:32:55,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575d3c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:55, skipping insertion in model container [2025-01-09 21:32:55,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:55" (3/3) ... [2025-01-09 21:32:55,350 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2025-01-09 21:32:55,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:55,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-ring-nondet.wvr.c that has 4 procedures, 460 locations, 1 initial locations, 6 loop locations, and 90 error locations. [2025-01-09 21:32:55,364 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:55,496 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:32:55,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 469 places, 480 transitions, 981 flow [2025-01-09 21:32:55,643 INFO L124 PetriNetUnfolderBase]: 21/477 cut-off events. [2025-01-09 21:32:55,645 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:32:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 477 events. 21/477 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 778 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 427. Up to 3 conditions per place. [2025-01-09 21:32:55,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 469 places, 480 transitions, 981 flow [2025-01-09 21:32:55,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 450 places, 460 transitions, 938 flow [2025-01-09 21:32:55,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:55,671 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;@1345a45d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:55,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2025-01-09 21:32:55,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:55,680 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-01-09 21:32:55,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:55,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:55,681 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] [2025-01-09 21:32:55,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:55,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1692569663, now seen corresponding path program 1 times [2025-01-09 21:32:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500507491] [2025-01-09 21:32:55,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:55,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:55,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:32:55,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:32:55,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:55,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:55,817 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:32:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500507491] [2025-01-09 21:32:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500507491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899458611] [2025-01-09 21:32:55,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:55,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:55,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:55,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:55,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 480 [2025-01-09 21:32:55,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 460 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:32:55,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:55,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 480 [2025-01-09 21:32:55,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:56,117 INFO L124 PetriNetUnfolderBase]: 152/786 cut-off events. [2025-01-09 21:32:56,118 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-01-09 21:32:56,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 786 events. 152/786 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2920 event pairs, 92 based on Foata normal form. 18/700 useless extension candidates. Maximal degree in co-relation 676. Up to 219 conditions per place. [2025-01-09 21:32:56,130 INFO L140 encePairwiseOnDemand]: 408/480 looper letters, 19 selfloop transitions, 2 changer transitions 7/390 dead transitions. [2025-01-09 21:32:56,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 390 transitions, 840 flow [2025-01-09 21:32:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2025-01-09 21:32:56,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8673611111111111 [2025-01-09 21:32:56,150 INFO L175 Difference]: Start difference. First operand has 450 places, 460 transitions, 938 flow. Second operand 3 states and 1249 transitions. [2025-01-09 21:32:56,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 390 transitions, 840 flow [2025-01-09 21:32:56,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 390 transitions, 828 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:32:56,202 INFO L231 Difference]: Finished difference. Result has 387 places, 383 transitions, 776 flow [2025-01-09 21:32:56,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=387, PETRI_TRANSITIONS=383} [2025-01-09 21:32:56,230 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -63 predicate places. [2025-01-09 21:32:56,232 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 383 transitions, 776 flow [2025-01-09 21:32:56,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:32:56,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:56,233 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] [2025-01-09 21:32:56,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:56,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:56,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash 8632843, now seen corresponding path program 1 times [2025-01-09 21:32:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:56,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165880203] [2025-01-09 21:32:56,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:56,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:32:56,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:32:56,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:56,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:56,328 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:32:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165880203] [2025-01-09 21:32:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165880203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:56,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:56,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395725585] [2025-01-09 21:32:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:56,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:56,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:56,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:56,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:56,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 480 [2025-01-09 21:32:56,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 383 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:32:56,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:56,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 480 [2025-01-09 21:32:56,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:56,572 INFO L124 PetriNetUnfolderBase]: 152/778 cut-off events. [2025-01-09 21:32:56,576 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:56,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 778 events. 152/778 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3113 event pairs, 92 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 985. Up to 219 conditions per place. [2025-01-09 21:32:56,581 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 19 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-01-09 21:32:56,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 382 transitions, 816 flow [2025-01-09 21:32:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1180 transitions. [2025-01-09 21:32:56,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2025-01-09 21:32:56,589 INFO L175 Difference]: Start difference. First operand has 387 places, 383 transitions, 776 flow. Second operand 3 states and 1180 transitions. [2025-01-09 21:32:56,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 382 transitions, 816 flow [2025-01-09 21:32:56,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 382 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:56,595 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 774 flow [2025-01-09 21:32:56,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2025-01-09 21:32:56,597 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -71 predicate places. [2025-01-09 21:32:56,597 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 774 flow [2025-01-09 21:32:56,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:32:56,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:56,598 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:32:56,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:56,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash 874025702, now seen corresponding path program 1 times [2025-01-09 21:32:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204718380] [2025-01-09 21:32:56,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:56,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:32:56,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:32:56,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:56,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:56,658 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:32:56,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:56,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204718380] [2025-01-09 21:32:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204718380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:56,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594430025] [2025-01-09 21:32:56,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:56,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:56,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:56,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:56,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480 [2025-01-09 21:32:56,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:56,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:56,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480 [2025-01-09 21:32:56,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:56,835 INFO L124 PetriNetUnfolderBase]: 127/699 cut-off events. [2025-01-09 21:32:56,835 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:56,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 699 events. 127/699 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2357 event pairs, 74 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 858. Up to 183 conditions per place. [2025-01-09 21:32:56,839 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-01-09 21:32:56,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 381 transitions, 812 flow [2025-01-09 21:32:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-01-09 21:32:56,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2025-01-09 21:32:56,842 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 774 flow. Second operand 3 states and 1182 transitions. [2025-01-09 21:32:56,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 381 transitions, 812 flow [2025-01-09 21:32:56,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 381 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:56,846 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 772 flow [2025-01-09 21:32:56,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-01-09 21:32:56,847 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -72 predicate places. [2025-01-09 21:32:56,847 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 772 flow [2025-01-09 21:32:56,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:56,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:56,848 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] [2025-01-09 21:32:56,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:56,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:56,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash 422355293, now seen corresponding path program 1 times [2025-01-09 21:32:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308068589] [2025-01-09 21:32:56,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:56,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:32:56,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:32:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:56,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:56,910 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:32:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308068589] [2025-01-09 21:32:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308068589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:56,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236630626] [2025-01-09 21:32:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:56,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:56,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:56,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480 [2025-01-09 21:32:56,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:56,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:56,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480 [2025-01-09 21:32:56,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:57,046 INFO L124 PetriNetUnfolderBase]: 127/698 cut-off events. [2025-01-09 21:32:57,046 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:57,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 698 events. 127/698 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2366 event pairs, 74 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 849. Up to 183 conditions per place. [2025-01-09 21:32:57,052 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2025-01-09 21:32:57,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 380 transitions, 810 flow [2025-01-09 21:32:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-01-09 21:32:57,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2025-01-09 21:32:57,055 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 772 flow. Second operand 3 states and 1182 transitions. [2025-01-09 21:32:57,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 380 transitions, 810 flow [2025-01-09 21:32:57,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 380 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:57,060 INFO L231 Difference]: Finished difference. Result has 377 places, 380 transitions, 770 flow [2025-01-09 21:32:57,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=377, PETRI_TRANSITIONS=380} [2025-01-09 21:32:57,061 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -73 predicate places. [2025-01-09 21:32:57,062 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 380 transitions, 770 flow [2025-01-09 21:32:57,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:57,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:57,063 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] [2025-01-09 21:32:57,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:57,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:57,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2014769168, now seen corresponding path program 1 times [2025-01-09 21:32:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350063349] [2025-01-09 21:32:57,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:57,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:32:57,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:32:57,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:57,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:57,114 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:32:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350063349] [2025-01-09 21:32:57,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350063349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:57,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:57,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109510533] [2025-01-09 21:32:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:57,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:57,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:57,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:57,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:57,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480 [2025-01-09 21:32:57,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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:32:57,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:57,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480 [2025-01-09 21:32:57,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:57,332 INFO L124 PetriNetUnfolderBase]: 211/958 cut-off events. [2025-01-09 21:32:57,333 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:57,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 958 events. 211/958 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4367 event pairs, 109 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1211. Up to 286 conditions per place. [2025-01-09 21:32:57,339 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2025-01-09 21:32:57,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 378 transitions, 804 flow [2025-01-09 21:32:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-01-09 21:32:57,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8229166666666666 [2025-01-09 21:32:57,342 INFO L175 Difference]: Start difference. First operand has 377 places, 380 transitions, 770 flow. Second operand 3 states and 1185 transitions. [2025-01-09 21:32:57,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 378 transitions, 804 flow [2025-01-09 21:32:57,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 378 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:57,346 INFO L231 Difference]: Finished difference. Result has 375 places, 378 transitions, 764 flow [2025-01-09 21:32:57,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=375, PETRI_TRANSITIONS=378} [2025-01-09 21:32:57,347 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -75 predicate places. [2025-01-09 21:32:57,347 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 378 transitions, 764 flow [2025-01-09 21:32:57,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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:32:57,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:57,348 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] [2025-01-09 21:32:57,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:57,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1137128302, now seen corresponding path program 1 times [2025-01-09 21:32:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302555516] [2025-01-09 21:32:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:32:57,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:32:57,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:57,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:57,435 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:32:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302555516] [2025-01-09 21:32:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302555516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471087146] [2025-01-09 21:32:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:57,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:57,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:57,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:57,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480 [2025-01-09 21:32:57,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 378 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:57,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:57,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480 [2025-01-09 21:32:57,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:57,635 INFO L124 PetriNetUnfolderBase]: 173/1216 cut-off events. [2025-01-09 21:32:57,635 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:57,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 1216 events. 173/1216 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6082 event pairs, 74 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1394. Up to 219 conditions per place. [2025-01-09 21:32:57,661 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-01-09 21:32:57,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 377 transitions, 802 flow [2025-01-09 21:32:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-01-09 21:32:57,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2025-01-09 21:32:57,664 INFO L175 Difference]: Start difference. First operand has 375 places, 378 transitions, 764 flow. Second operand 3 states and 1182 transitions. [2025-01-09 21:32:57,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 377 transitions, 802 flow [2025-01-09 21:32:57,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 377 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:57,668 INFO L231 Difference]: Finished difference. Result has 375 places, 377 transitions, 765 flow [2025-01-09 21:32:57,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=375, PETRI_TRANSITIONS=377} [2025-01-09 21:32:57,669 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -75 predicate places. [2025-01-09 21:32:57,669 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 377 transitions, 765 flow [2025-01-09 21:32:57,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:57,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:57,670 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] [2025-01-09 21:32:57,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:57,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:57,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:57,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1384446932, now seen corresponding path program 1 times [2025-01-09 21:32:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906639935] [2025-01-09 21:32:57,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:57,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:32:57,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:32:57,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:57,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:58,164 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:32:58,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:58,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906639935] [2025-01-09 21:32:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906639935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:58,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592674079] [2025-01-09 21:32:58,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:58,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:58,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:58,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:58,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 480 [2025-01-09 21:32:58,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 765 flow. Second operand has 6 states, 6 states have (on average 350.5) internal successors, (2103), 6 states have internal predecessors, (2103), 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:32:58,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:58,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 480 [2025-01-09 21:32:58,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:58,590 INFO L124 PetriNetUnfolderBase]: 244/1241 cut-off events. [2025-01-09 21:32:58,591 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:58,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 1241 events. 244/1241 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6063 event pairs, 128 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1576. Up to 348 conditions per place. [2025-01-09 21:32:58,597 INFO L140 encePairwiseOnDemand]: 462/480 looper letters, 42 selfloop transitions, 15 changer transitions 0/374 dead transitions. [2025-01-09 21:32:58,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 374 transitions, 873 flow [2025-01-09 21:32:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2154 transitions. [2025-01-09 21:32:58,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7479166666666667 [2025-01-09 21:32:58,601 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 765 flow. Second operand 6 states and 2154 transitions. [2025-01-09 21:32:58,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 374 transitions, 873 flow [2025-01-09 21:32:58,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 374 transitions, 869 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:58,606 INFO L231 Difference]: Finished difference. Result has 375 places, 374 transitions, 785 flow [2025-01-09 21:32:58,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=785, PETRI_PLACES=375, PETRI_TRANSITIONS=374} [2025-01-09 21:32:58,609 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -75 predicate places. [2025-01-09 21:32:58,609 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 374 transitions, 785 flow [2025-01-09 21:32:58,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 350.5) internal successors, (2103), 6 states have internal predecessors, (2103), 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:32:58,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:58,611 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] [2025-01-09 21:32:58,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:58,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:58,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash 643662008, now seen corresponding path program 1 times [2025-01-09 21:32:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:58,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159061007] [2025-01-09 21:32:58,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:58,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:32:58,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:32:58,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:58,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:58,651 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:32:58,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:58,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159061007] [2025-01-09 21:32:58,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159061007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:58,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:58,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:58,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377456380] [2025-01-09 21:32:58,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:58,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:58,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:58,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:58,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:58,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:32:58,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 374 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:32:58,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:58,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:32:58,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:58,739 INFO L124 PetriNetUnfolderBase]: 151/731 cut-off events. [2025-01-09 21:32:58,739 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:58,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 731 events. 151/731 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2478 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 921. Up to 202 conditions per place. [2025-01-09 21:32:58,743 INFO L140 encePairwiseOnDemand]: 478/480 looper letters, 16 selfloop transitions, 1 changer transitions 0/373 dead transitions. [2025-01-09 21:32:58,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 373 transitions, 817 flow [2025-01-09 21:32:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-01-09 21:32:58,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8270833333333333 [2025-01-09 21:32:58,747 INFO L175 Difference]: Start difference. First operand has 375 places, 374 transitions, 785 flow. Second operand 3 states and 1191 transitions. [2025-01-09 21:32:58,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 373 transitions, 817 flow [2025-01-09 21:32:58,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 373 transitions, 787 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:58,751 INFO L231 Difference]: Finished difference. Result has 371 places, 373 transitions, 755 flow [2025-01-09 21:32:58,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=371, PETRI_TRANSITIONS=373} [2025-01-09 21:32:58,752 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -79 predicate places. [2025-01-09 21:32:58,752 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 373 transitions, 755 flow [2025-01-09 21:32:58,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:32:58,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:58,753 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] [2025-01-09 21:32:58,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:58,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:58,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash -592218408, now seen corresponding path program 1 times [2025-01-09 21:32:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:58,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560641593] [2025-01-09 21:32:58,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:58,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:32:58,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:32:58,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:58,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:58,806 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:32:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560641593] [2025-01-09 21:32:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560641593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247614802] [2025-01-09 21:32:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:58,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:58,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:58,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:58,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:58,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480 [2025-01-09 21:32:58,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 373 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:32:58,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:58,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480 [2025-01-09 21:32:58,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:58,914 INFO L124 PetriNetUnfolderBase]: 151/730 cut-off events. [2025-01-09 21:32:58,914 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:58,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 730 events. 151/730 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2480 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 893. Up to 204 conditions per place. [2025-01-09 21:32:58,918 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 17 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-01-09 21:32:58,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 372 transitions, 791 flow [2025-01-09 21:32:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-01-09 21:32:58,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-01-09 21:32:58,921 INFO L175 Difference]: Start difference. First operand has 371 places, 373 transitions, 755 flow. Second operand 3 states and 1184 transitions. [2025-01-09 21:32:58,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 372 transitions, 791 flow [2025-01-09 21:32:58,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 372 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:58,925 INFO L231 Difference]: Finished difference. Result has 371 places, 372 transitions, 756 flow [2025-01-09 21:32:58,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=371, PETRI_TRANSITIONS=372} [2025-01-09 21:32:58,926 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -79 predicate places. [2025-01-09 21:32:58,926 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 372 transitions, 756 flow [2025-01-09 21:32:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:32:58,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:58,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:58,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:58,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:58,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -649135766, now seen corresponding path program 1 times [2025-01-09 21:32:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:58,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777332950] [2025-01-09 21:32:58,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:58,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 21:32:58,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 21:32:58,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:58,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:58,963 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:32:58,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:58,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777332950] [2025-01-09 21:32:58,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777332950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:58,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:58,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:58,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431942157] [2025-01-09 21:32:58,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:58,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:58,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:58,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:58,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:32:58,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 372 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:32:58,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:58,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:32:58,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:59,054 INFO L124 PetriNetUnfolderBase]: 151/729 cut-off events. [2025-01-09 21:32:59,054 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:59,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 729 events. 151/729 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2476 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 892. Up to 202 conditions per place. [2025-01-09 21:32:59,058 INFO L140 encePairwiseOnDemand]: 478/480 looper letters, 16 selfloop transitions, 1 changer transitions 0/371 dead transitions. [2025-01-09 21:32:59,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 371 transitions, 788 flow [2025-01-09 21:32:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-01-09 21:32:59,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8270833333333333 [2025-01-09 21:32:59,074 INFO L175 Difference]: Start difference. First operand has 371 places, 372 transitions, 756 flow. Second operand 3 states and 1191 transitions. [2025-01-09 21:32:59,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 371 transitions, 788 flow [2025-01-09 21:32:59,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 371 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:59,087 INFO L231 Difference]: Finished difference. Result has 370 places, 371 transitions, 752 flow [2025-01-09 21:32:59,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=370, PETRI_TRANSITIONS=371} [2025-01-09 21:32:59,089 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -80 predicate places. [2025-01-09 21:32:59,089 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 371 transitions, 752 flow [2025-01-09 21:32:59,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:32:59,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:59,090 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] [2025-01-09 21:32:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:59,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:59,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1092212910, now seen corresponding path program 1 times [2025-01-09 21:32:59,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:59,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460649525] [2025-01-09 21:32:59,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:59,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:59,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:32:59,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:32:59,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:59,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:59,239 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:32:59,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:59,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460649525] [2025-01-09 21:32:59,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460649525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:59,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:59,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52287432] [2025-01-09 21:32:59,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:59,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:59,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:59,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:59,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:59,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480 [2025-01-09 21:32:59,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 371 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:32:59,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:59,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480 [2025-01-09 21:32:59,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:59,423 INFO L124 PetriNetUnfolderBase]: 151/728 cut-off events. [2025-01-09 21:32:59,423 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 728 events. 151/728 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2472 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 892. Up to 204 conditions per place. [2025-01-09 21:32:59,439 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 17 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-01-09 21:32:59,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 370 transitions, 788 flow [2025-01-09 21:32:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-01-09 21:32:59,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-01-09 21:32:59,442 INFO L175 Difference]: Start difference. First operand has 370 places, 371 transitions, 752 flow. Second operand 3 states and 1184 transitions. [2025-01-09 21:32:59,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 370 transitions, 788 flow [2025-01-09 21:32:59,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:59,446 INFO L231 Difference]: Finished difference. Result has 370 places, 370 transitions, 753 flow [2025-01-09 21:32:59,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=370, PETRI_TRANSITIONS=370} [2025-01-09 21:32:59,447 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -80 predicate places. [2025-01-09 21:32:59,447 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 370 transitions, 753 flow [2025-01-09 21:32:59,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:32:59,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:59,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:59,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:59,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:59,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash -100333475, now seen corresponding path program 1 times [2025-01-09 21:32:59,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:59,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820625262] [2025-01-09 21:32:59,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:59,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:32:59,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:32:59,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:59,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:59,499 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:32:59,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:59,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820625262] [2025-01-09 21:32:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820625262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:59,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957708195] [2025-01-09 21:32:59,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:59,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:59,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:59,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:59,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480 [2025-01-09 21:32:59,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 370 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:59,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:59,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480 [2025-01-09 21:32:59,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:59,604 INFO L124 PetriNetUnfolderBase]: 151/727 cut-off events. [2025-01-09 21:32:59,605 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:59,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 727 events. 151/727 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2452 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 894. Up to 205 conditions per place. [2025-01-09 21:32:59,609 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-01-09 21:32:59,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 791 flow [2025-01-09 21:32:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-01-09 21:32:59,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2025-01-09 21:32:59,611 INFO L175 Difference]: Start difference. First operand has 370 places, 370 transitions, 753 flow. Second operand 3 states and 1182 transitions. [2025-01-09 21:32:59,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 791 flow [2025-01-09 21:32:59,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 369 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:59,616 INFO L231 Difference]: Finished difference. Result has 369 places, 369 transitions, 751 flow [2025-01-09 21:32:59,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=369, PETRI_TRANSITIONS=369} [2025-01-09 21:32:59,618 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -81 predicate places. [2025-01-09 21:32:59,618 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 751 flow [2025-01-09 21:32:59,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:59,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:59,619 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:32:59,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:59,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1495961775, now seen corresponding path program 1 times [2025-01-09 21:32:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984449620] [2025-01-09 21:32:59,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:59,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:32:59,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:32:59,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:59,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:59,672 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:32:59,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:59,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984449620] [2025-01-09 21:32:59,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984449620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:59,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:59,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:59,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532936367] [2025-01-09 21:32:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:59,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:59,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:59,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:59,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480 [2025-01-09 21:32:59,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:59,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:59,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480 [2025-01-09 21:32:59,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:59,780 INFO L124 PetriNetUnfolderBase]: 151/726 cut-off events. [2025-01-09 21:32:59,780 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:59,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 726 events. 151/726 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2470 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 893. Up to 205 conditions per place. [2025-01-09 21:32:59,785 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-01-09 21:32:59,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 368 transitions, 789 flow [2025-01-09 21:32:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-01-09 21:32:59,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2025-01-09 21:32:59,788 INFO L175 Difference]: Start difference. First operand has 369 places, 369 transitions, 751 flow. Second operand 3 states and 1182 transitions. [2025-01-09 21:32:59,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 368 transitions, 789 flow [2025-01-09 21:32:59,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 368 transitions, 785 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:59,792 INFO L231 Difference]: Finished difference. Result has 368 places, 368 transitions, 749 flow [2025-01-09 21:32:59,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=749, PETRI_PLACES=368, PETRI_TRANSITIONS=368} [2025-01-09 21:32:59,793 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -82 predicate places. [2025-01-09 21:32:59,794 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 368 transitions, 749 flow [2025-01-09 21:32:59,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:59,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:59,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:59,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:59,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:59,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1863613612, now seen corresponding path program 1 times [2025-01-09 21:32:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149261040] [2025-01-09 21:32:59,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:59,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:32:59,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:32:59,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:59,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:59,857 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:32:59,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149261040] [2025-01-09 21:32:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149261040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:59,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:59,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62112441] [2025-01-09 21:32:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:59,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:59,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:59,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:59,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480 [2025-01-09 21:32:59,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 368 transitions, 749 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:59,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:59,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480 [2025-01-09 21:32:59,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:59,956 INFO L124 PetriNetUnfolderBase]: 151/725 cut-off events. [2025-01-09 21:32:59,956 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 725 events. 151/725 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2461 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 892. Up to 205 conditions per place. [2025-01-09 21:32:59,960 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-01-09 21:32:59,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 367 transitions, 787 flow [2025-01-09 21:32:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-01-09 21:32:59,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2025-01-09 21:32:59,963 INFO L175 Difference]: Start difference. First operand has 368 places, 368 transitions, 749 flow. Second operand 3 states and 1182 transitions. [2025-01-09 21:32:59,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 367 transitions, 787 flow [2025-01-09 21:32:59,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 367 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:59,968 INFO L231 Difference]: Finished difference. Result has 367 places, 367 transitions, 747 flow [2025-01-09 21:32:59,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=367, PETRI_TRANSITIONS=367} [2025-01-09 21:32:59,969 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2025-01-09 21:32:59,969 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 367 transitions, 747 flow [2025-01-09 21:32:59,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:32:59,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:59,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:59,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:59,971 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:32:59,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1627888684, now seen corresponding path program 1 times [2025-01-09 21:32:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:59,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301861849] [2025-01-09 21:32:59,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:59,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 21:32:59,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 21:32:59,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:59,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:00,014 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:00,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:00,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301861849] [2025-01-09 21:33:00,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301861849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:00,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:00,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:00,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195929334] [2025-01-09 21:33:00,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:00,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:00,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:00,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:00,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:00,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:33:00,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 367 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:00,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:00,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:33:00,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:00,122 INFO L124 PetriNetUnfolderBase]: 140/708 cut-off events. [2025-01-09 21:33:00,126 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 21:33:00,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 708 events. 140/708 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2387 event pairs, 13 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 867. Up to 147 conditions per place. [2025-01-09 21:33:00,131 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 24 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-01-09 21:33:00,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 375 transitions, 817 flow [2025-01-09 21:33:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2025-01-09 21:33:00,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-01-09 21:33:00,134 INFO L175 Difference]: Start difference. First operand has 367 places, 367 transitions, 747 flow. Second operand 3 states and 1200 transitions. [2025-01-09 21:33:00,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 375 transitions, 817 flow [2025-01-09 21:33:00,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 375 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:00,141 INFO L231 Difference]: Finished difference. Result has 367 places, 367 transitions, 751 flow [2025-01-09 21:33:00,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=367, PETRI_TRANSITIONS=367} [2025-01-09 21:33:00,142 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2025-01-09 21:33:00,142 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 367 transitions, 751 flow [2025-01-09 21:33:00,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:00,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:00,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:00,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:00,144 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:00,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 568832305, now seen corresponding path program 1 times [2025-01-09 21:33:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232943046] [2025-01-09 21:33:00,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:00,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:00,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 21:33:00,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 21:33:00,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:00,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:00,244 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:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232943046] [2025-01-09 21:33:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232943046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:00,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:00,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056155836] [2025-01-09 21:33:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:00,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:00,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:00,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:00,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 480 [2025-01-09 21:33:00,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 367 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:00,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:00,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 480 [2025-01-09 21:33:00,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:00,463 INFO L124 PetriNetUnfolderBase]: 225/943 cut-off events. [2025-01-09 21:33:00,463 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-01-09 21:33:00,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 943 events. 225/943 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4197 event pairs, 127 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 1327. Up to 318 conditions per place. [2025-01-09 21:33:00,468 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 21 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2025-01-09 21:33:00,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 366 transitions, 795 flow [2025-01-09 21:33:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-01-09 21:33:00,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8180555555555555 [2025-01-09 21:33:00,471 INFO L175 Difference]: Start difference. First operand has 367 places, 367 transitions, 751 flow. Second operand 3 states and 1178 transitions. [2025-01-09 21:33:00,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 366 transitions, 795 flow [2025-01-09 21:33:00,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 366 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:00,476 INFO L231 Difference]: Finished difference. Result has 367 places, 366 transitions, 751 flow [2025-01-09 21:33:00,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=367, PETRI_TRANSITIONS=366} [2025-01-09 21:33:00,477 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2025-01-09 21:33:00,477 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 366 transitions, 751 flow [2025-01-09 21:33:00,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:00,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:00,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:00,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:00,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:00,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1856049339, now seen corresponding path program 1 times [2025-01-09 21:33:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769717807] [2025-01-09 21:33:00,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:00,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 21:33:00,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 21:33:00,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:00,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:00,535 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:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769717807] [2025-01-09 21:33:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769717807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:00,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:00,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829119352] [2025-01-09 21:33:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:00,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:00,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:00,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:00,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:33:00,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 366 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:00,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:00,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:33:00,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:00,649 INFO L124 PetriNetUnfolderBase]: 152/737 cut-off events. [2025-01-09 21:33:00,649 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:33:00,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 737 events. 152/737 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2529 event pairs, 27 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 951. Up to 125 conditions per place. [2025-01-09 21:33:00,653 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 26 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-01-09 21:33:00,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 375 transitions, 831 flow [2025-01-09 21:33:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2025-01-09 21:33:00,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-01-09 21:33:00,655 INFO L175 Difference]: Start difference. First operand has 367 places, 366 transitions, 751 flow. Second operand 3 states and 1200 transitions. [2025-01-09 21:33:00,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 375 transitions, 831 flow [2025-01-09 21:33:00,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 375 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:00,659 INFO L231 Difference]: Finished difference. Result has 367 places, 366 transitions, 755 flow [2025-01-09 21:33:00,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=367, PETRI_TRANSITIONS=366} [2025-01-09 21:33:00,660 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2025-01-09 21:33:00,660 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 366 transitions, 755 flow [2025-01-09 21:33:00,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:00,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:00,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:00,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:00,661 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -512831078, now seen corresponding path program 1 times [2025-01-09 21:33:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583086241] [2025-01-09 21:33:00,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:00,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 21:33:00,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 21:33:00,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:00,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:00,704 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:00,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:00,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583086241] [2025-01-09 21:33:00,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583086241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:00,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:00,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:00,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527128667] [2025-01-09 21:33:00,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:00,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:00,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:00,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:00,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:00,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480 [2025-01-09 21:33:00,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 366 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:00,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:00,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480 [2025-01-09 21:33:00,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:00,828 INFO L124 PetriNetUnfolderBase]: 152/731 cut-off events. [2025-01-09 21:33:00,829 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-09 21:33:00,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 731 events. 152/731 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2527 event pairs, 73 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 993. Up to 214 conditions per place. [2025-01-09 21:33:00,831 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 19 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-01-09 21:33:00,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 365 transitions, 795 flow [2025-01-09 21:33:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-01-09 21:33:00,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-01-09 21:33:00,834 INFO L175 Difference]: Start difference. First operand has 367 places, 366 transitions, 755 flow. Second operand 3 states and 1184 transitions. [2025-01-09 21:33:00,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 365 transitions, 795 flow [2025-01-09 21:33:00,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 365 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:00,838 INFO L231 Difference]: Finished difference. Result has 367 places, 365 transitions, 755 flow [2025-01-09 21:33:00,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=367, PETRI_TRANSITIONS=365} [2025-01-09 21:33:00,839 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2025-01-09 21:33:00,839 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 365 transitions, 755 flow [2025-01-09 21:33:00,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:00,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:00,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:00,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:33:00,840 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:00,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash -550313028, now seen corresponding path program 1 times [2025-01-09 21:33:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:00,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684319323] [2025-01-09 21:33:00,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:00,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 21:33:00,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 21:33:00,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:00,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:00,885 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:00,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:00,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684319323] [2025-01-09 21:33:00,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684319323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:00,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:00,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:00,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713263874] [2025-01-09 21:33:00,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:00,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:00,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:00,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:00,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:33:00,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 365 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:00,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:00,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:33:00,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:01,045 INFO L124 PetriNetUnfolderBase]: 236/1206 cut-off events. [2025-01-09 21:33:01,045 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-01-09 21:33:01,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 1206 events. 236/1206 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6125 event pairs, 73 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1613. Up to 212 conditions per place. [2025-01-09 21:33:01,051 INFO L140 encePairwiseOnDemand]: 476/480 looper letters, 29 selfloop transitions, 3 changer transitions 0/377 dead transitions. [2025-01-09 21:33:01,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 377 transitions, 856 flow [2025-01-09 21:33:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1202 transitions. [2025-01-09 21:33:01,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8347222222222223 [2025-01-09 21:33:01,054 INFO L175 Difference]: Start difference. First operand has 367 places, 365 transitions, 755 flow. Second operand 3 states and 1202 transitions. [2025-01-09 21:33:01,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 377 transitions, 856 flow [2025-01-09 21:33:01,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 377 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:01,058 INFO L231 Difference]: Finished difference. Result has 367 places, 365 transitions, 762 flow [2025-01-09 21:33:01,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=367, PETRI_TRANSITIONS=365} [2025-01-09 21:33:01,059 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2025-01-09 21:33:01,059 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 365 transitions, 762 flow [2025-01-09 21:33:01,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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:01,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:01,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:01,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:33:01,060 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:01,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2110554553, now seen corresponding path program 1 times [2025-01-09 21:33:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:01,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257896125] [2025-01-09 21:33:01,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:01,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 21:33:01,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 21:33:01,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:01,105 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:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257896125] [2025-01-09 21:33:01,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257896125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:01,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325644471] [2025-01-09 21:33:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:01,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:01,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:01,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:01,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480 [2025-01-09 21:33:01,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 365 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:01,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:01,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480 [2025-01-09 21:33:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:01,255 INFO L124 PetriNetUnfolderBase]: 224/960 cut-off events. [2025-01-09 21:33:01,255 INFO L125 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2025-01-09 21:33:01,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 960 events. 224/960 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4093 event pairs, 123 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1432. Up to 324 conditions per place. [2025-01-09 21:33:01,259 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 20 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-01-09 21:33:01,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 364 transitions, 804 flow [2025-01-09 21:33:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-01-09 21:33:01,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-01-09 21:33:01,262 INFO L175 Difference]: Start difference. First operand has 367 places, 365 transitions, 762 flow. Second operand 3 states and 1184 transitions. [2025-01-09 21:33:01,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 364 transitions, 804 flow [2025-01-09 21:33:01,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 364 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:01,266 INFO L231 Difference]: Finished difference. Result has 367 places, 364 transitions, 761 flow [2025-01-09 21:33:01,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=367, PETRI_TRANSITIONS=364} [2025-01-09 21:33:01,267 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2025-01-09 21:33:01,267 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 364 transitions, 761 flow [2025-01-09 21:33:01,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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:01,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:01,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:01,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:33:01,268 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:01,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1502824123, now seen corresponding path program 1 times [2025-01-09 21:33:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263224258] [2025-01-09 21:33:01,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:01,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 21:33:01,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 21:33:01,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:01,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:01,315 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:01,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:01,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263224258] [2025-01-09 21:33:01,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263224258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:01,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449635254] [2025-01-09 21:33:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:01,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:01,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:01,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480 [2025-01-09 21:33:01,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 364 transitions, 761 flow. Second operand has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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:01,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:01,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480 [2025-01-09 21:33:01,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:01,499 INFO L124 PetriNetUnfolderBase]: 323/1581 cut-off events. [2025-01-09 21:33:01,499 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-01-09 21:33:01,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 1581 events. 323/1581 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8856 event pairs, 183 based on Foata normal form. 0/1329 useless extension candidates. Maximal degree in co-relation 2226. Up to 456 conditions per place. [2025-01-09 21:33:01,507 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 21 selfloop transitions, 1 changer transitions 0/362 dead transitions. [2025-01-09 21:33:01,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 362 transitions, 801 flow [2025-01-09 21:33:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-01-09 21:33:01,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8229166666666666 [2025-01-09 21:33:01,510 INFO L175 Difference]: Start difference. First operand has 367 places, 364 transitions, 761 flow. Second operand 3 states and 1185 transitions. [2025-01-09 21:33:01,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 362 transitions, 801 flow [2025-01-09 21:33:01,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 362 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:01,515 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 755 flow [2025-01-09 21:33:01,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2025-01-09 21:33:01,515 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -85 predicate places. [2025-01-09 21:33:01,515 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 755 flow [2025-01-09 21:33:01,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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:01,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:01,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:33:01,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash -204541485, now seen corresponding path program 1 times [2025-01-09 21:33:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912396911] [2025-01-09 21:33:01,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:01,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:33:01,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:33:01,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:01,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:01,565 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:01,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:01,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912396911] [2025-01-09 21:33:01,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912396911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:01,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:01,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181558087] [2025-01-09 21:33:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:01,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:01,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:01,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:01,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 480 [2025-01-09 21:33:01,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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:01,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:01,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 480 [2025-01-09 21:33:01,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:01,764 INFO L124 PetriNetUnfolderBase]: 327/1521 cut-off events. [2025-01-09 21:33:01,764 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2025-01-09 21:33:01,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2241 conditions, 1521 events. 327/1521 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8225 event pairs, 138 based on Foata normal form. 0/1312 useless extension candidates. Maximal degree in co-relation 2176. Up to 383 conditions per place. [2025-01-09 21:33:01,771 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 28 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-01-09 21:33:01,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 369 transitions, 839 flow [2025-01-09 21:33:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1193 transitions. [2025-01-09 21:33:01,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8284722222222223 [2025-01-09 21:33:01,774 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 755 flow. Second operand 3 states and 1193 transitions. [2025-01-09 21:33:01,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 369 transitions, 839 flow [2025-01-09 21:33:01,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 369 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:01,778 INFO L231 Difference]: Finished difference. Result has 365 places, 361 transitions, 756 flow [2025-01-09 21:33:01,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=365, PETRI_TRANSITIONS=361} [2025-01-09 21:33:01,779 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -85 predicate places. [2025-01-09 21:33:01,779 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 361 transitions, 756 flow [2025-01-09 21:33:01,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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:01,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:01,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:01,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:33:01,780 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:01,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1473928444, now seen corresponding path program 1 times [2025-01-09 21:33:01,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:01,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044145369] [2025-01-09 21:33:01,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:01,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 21:33:01,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 21:33:01,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:01,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:01,822 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:01,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044145369] [2025-01-09 21:33:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044145369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:01,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423794946] [2025-01-09 21:33:01,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:01,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:01,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:01,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 480 [2025-01-09 21:33:01,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 361 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:01,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:01,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 480 [2025-01-09 21:33:01,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:02,137 INFO L124 PetriNetUnfolderBase]: 561/2044 cut-off events. [2025-01-09 21:33:02,137 INFO L125 PetriNetUnfolderBase]: For 371/371 co-relation queries the response was YES. [2025-01-09 21:33:02,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 2044 events. 561/2044 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12421 event pairs, 94 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 3200. Up to 636 conditions per place. [2025-01-09 21:33:02,147 INFO L140 encePairwiseOnDemand]: 473/480 looper letters, 32 selfloop transitions, 5 changer transitions 0/371 dead transitions. [2025-01-09 21:33:02,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 371 transitions, 863 flow [2025-01-09 21:33:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-01-09 21:33:02,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2025-01-09 21:33:02,150 INFO L175 Difference]: Start difference. First operand has 365 places, 361 transitions, 756 flow. Second operand 3 states and 1190 transitions. [2025-01-09 21:33:02,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 371 transitions, 863 flow [2025-01-09 21:33:02,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 371 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:02,155 INFO L231 Difference]: Finished difference. Result has 364 places, 362 transitions, 786 flow [2025-01-09 21:33:02,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=364, PETRI_TRANSITIONS=362} [2025-01-09 21:33:02,156 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -86 predicate places. [2025-01-09 21:33:02,156 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 362 transitions, 786 flow [2025-01-09 21:33:02,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:02,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:02,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:02,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:33:02,157 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:02,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1749891789, now seen corresponding path program 1 times [2025-01-09 21:33:02,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:02,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855759248] [2025-01-09 21:33:02,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:02,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 21:33:02,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 21:33:02,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:02,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:02,205 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:02,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:02,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855759248] [2025-01-09 21:33:02,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855759248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066421684] [2025-01-09 21:33:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:02,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:02,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:02,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:02,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:33:02,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 362 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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:02,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:02,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:33:02,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:02,468 INFO L124 PetriNetUnfolderBase]: 407/1869 cut-off events. [2025-01-09 21:33:02,468 INFO L125 PetriNetUnfolderBase]: For 728/748 co-relation queries the response was YES. [2025-01-09 21:33:02,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 1869 events. 407/1869 cut-off events. For 728/748 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11602 event pairs, 150 based on Foata normal form. 4/1682 useless extension candidates. Maximal degree in co-relation 2981. Up to 524 conditions per place. [2025-01-09 21:33:02,474 INFO L140 encePairwiseOnDemand]: 476/480 looper letters, 29 selfloop transitions, 4 changer transitions 0/371 dead transitions. [2025-01-09 21:33:02,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 371 transitions, 890 flow [2025-01-09 21:33:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2025-01-09 21:33:02,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8326388888888889 [2025-01-09 21:33:02,477 INFO L175 Difference]: Start difference. First operand has 364 places, 362 transitions, 786 flow. Second operand 3 states and 1199 transitions. [2025-01-09 21:33:02,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 371 transitions, 890 flow [2025-01-09 21:33:02,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 371 transitions, 878 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:02,482 INFO L231 Difference]: Finished difference. Result has 364 places, 365 transitions, 812 flow [2025-01-09 21:33:02,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=364, PETRI_TRANSITIONS=365} [2025-01-09 21:33:02,484 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -86 predicate places. [2025-01-09 21:33:02,484 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 365 transitions, 812 flow [2025-01-09 21:33:02,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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:02,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:02,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:02,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:33:02,485 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:02,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1100374567, now seen corresponding path program 1 times [2025-01-09 21:33:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590204139] [2025-01-09 21:33:02,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:02,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 21:33:02,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 21:33:02,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:02,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:02,991 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:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:02,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590204139] [2025-01-09 21:33:02,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590204139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:02,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:02,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:02,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848597183] [2025-01-09 21:33:02,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:02,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:02,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:02,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:02,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:03,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 480 [2025-01-09 21:33:03,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 365 transitions, 812 flow. Second operand has 6 states, 6 states have (on average 374.8333333333333) internal successors, (2249), 6 states have internal predecessors, (2249), 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:03,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:03,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 480 [2025-01-09 21:33:03,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:03,513 INFO L124 PetriNetUnfolderBase]: 618/2374 cut-off events. [2025-01-09 21:33:03,513 INFO L125 PetriNetUnfolderBase]: For 1199/1218 co-relation queries the response was YES. [2025-01-09 21:33:03,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4168 conditions, 2374 events. 618/2374 cut-off events. For 1199/1218 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 15866 event pairs, 131 based on Foata normal form. 7/2162 useless extension candidates. Maximal degree in co-relation 4100. Up to 440 conditions per place. [2025-01-09 21:33:03,529 INFO L140 encePairwiseOnDemand]: 473/480 looper letters, 76 selfloop transitions, 6 changer transitions 0/402 dead transitions. [2025-01-09 21:33:03,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 402 transitions, 1118 flow [2025-01-09 21:33:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2304 transitions. [2025-01-09 21:33:03,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-01-09 21:33:03,533 INFO L175 Difference]: Start difference. First operand has 364 places, 365 transitions, 812 flow. Second operand 6 states and 2304 transitions. [2025-01-09 21:33:03,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 402 transitions, 1118 flow [2025-01-09 21:33:03,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 402 transitions, 1118 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:03,538 INFO L231 Difference]: Finished difference. Result has 373 places, 369 transitions, 856 flow [2025-01-09 21:33:03,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=373, PETRI_TRANSITIONS=369} [2025-01-09 21:33:03,539 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -77 predicate places. [2025-01-09 21:33:03,539 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 369 transitions, 856 flow [2025-01-09 21:33:03,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 374.8333333333333) internal successors, (2249), 6 states have internal predecessors, (2249), 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:03,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:03,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:33:03,541 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:03,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -5449505, now seen corresponding path program 1 times [2025-01-09 21:33:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37925144] [2025-01-09 21:33:03,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:03,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 21:33:03,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 21:33:03,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:03,784 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:03,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:03,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37925144] [2025-01-09 21:33:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37925144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:03,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:33:03,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351687218] [2025-01-09 21:33:03,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:03,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:03,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:03,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:03,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:33:03,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 369 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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:03,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:03,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:33:03,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:03,983 INFO L124 PetriNetUnfolderBase]: 382/1638 cut-off events. [2025-01-09 21:33:03,983 INFO L125 PetriNetUnfolderBase]: For 941/983 co-relation queries the response was YES. [2025-01-09 21:33:03,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 1638 events. 382/1638 cut-off events. For 941/983 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9499 event pairs, 80 based on Foata normal form. 35/1483 useless extension candidates. Maximal degree in co-relation 2825. Up to 432 conditions per place. [2025-01-09 21:33:03,991 INFO L140 encePairwiseOnDemand]: 477/480 looper letters, 36 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-01-09 21:33:03,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 980 flow [2025-01-09 21:33:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2025-01-09 21:33:03,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-01-09 21:33:03,994 INFO L175 Difference]: Start difference. First operand has 373 places, 369 transitions, 856 flow. Second operand 3 states and 1200 transitions. [2025-01-09 21:33:03,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 980 flow [2025-01-09 21:33:03,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 379 transitions, 980 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:03,998 INFO L231 Difference]: Finished difference. Result has 376 places, 370 transitions, 868 flow [2025-01-09 21:33:03,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=376, PETRI_TRANSITIONS=370} [2025-01-09 21:33:03,998 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -74 predicate places. [2025-01-09 21:33:03,998 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 370 transitions, 868 flow [2025-01-09 21:33:03,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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:03,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:03,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:33:04,000 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:04,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1657074995, now seen corresponding path program 2 times [2025-01-09 21:33:04,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773376032] [2025-01-09 21:33:04,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:33:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:04,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 267 statements into 1 equivalence classes. [2025-01-09 21:33:04,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 21:33:04,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:33:04,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:04,214 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:04,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773376032] [2025-01-09 21:33:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773376032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:04,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:04,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:33:04,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052250882] [2025-01-09 21:33:04,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:04,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:04,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:04,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:04,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:33:04,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 370 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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:04,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:04,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:33:04,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:04,442 INFO L124 PetriNetUnfolderBase]: 376/1749 cut-off events. [2025-01-09 21:33:04,442 INFO L125 PetriNetUnfolderBase]: For 1070/1108 co-relation queries the response was YES. [2025-01-09 21:33:04,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 1749 events. 376/1749 cut-off events. For 1070/1108 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9690 event pairs, 124 based on Foata normal form. 12/1549 useless extension candidates. Maximal degree in co-relation 3094. Up to 514 conditions per place. [2025-01-09 21:33:04,450 INFO L140 encePairwiseOnDemand]: 476/480 looper letters, 30 selfloop transitions, 4 changer transitions 0/375 dead transitions. [2025-01-09 21:33:04,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 375 transitions, 952 flow [2025-01-09 21:33:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2025-01-09 21:33:04,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8319444444444445 [2025-01-09 21:33:04,452 INFO L175 Difference]: Start difference. First operand has 376 places, 370 transitions, 868 flow. Second operand 3 states and 1198 transitions. [2025-01-09 21:33:04,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 375 transitions, 952 flow [2025-01-09 21:33:04,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 375 transitions, 950 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:04,457 INFO L231 Difference]: Finished difference. Result has 378 places, 370 transitions, 882 flow [2025-01-09 21:33:04,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=378, PETRI_TRANSITIONS=370} [2025-01-09 21:33:04,458 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -72 predicate places. [2025-01-09 21:33:04,458 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 370 transitions, 882 flow [2025-01-09 21:33:04,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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:04,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:04,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:33:04,459 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-01-09 21:33:04,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1062891777, now seen corresponding path program 3 times [2025-01-09 21:33:04,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:04,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18433667] [2025-01-09 21:33:04,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:33:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:04,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 267 statements into 1 equivalence classes. [2025-01-09 21:33:04,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 21:33:04,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:33:04,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:04,545 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:04,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:04,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18433667] [2025-01-09 21:33:04,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18433667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:04,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:04,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:04,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303272364] [2025-01-09 21:33:04,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:04,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:04,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:04,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:04,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480 [2025-01-09 21:33:04,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 370 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 395.6666666666667) internal successors, (1187), 3 states have internal predecessors, (1187), 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:04,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:04,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480 [2025-01-09 21:33:04,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:04,855 INFO L124 PetriNetUnfolderBase]: 386/1902 cut-off events. [2025-01-09 21:33:04,856 INFO L125 PetriNetUnfolderBase]: For 1228/1262 co-relation queries the response was YES. [2025-01-09 21:33:04,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 1902 events. 386/1902 cut-off events. For 1228/1262 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10905 event pairs, 172 based on Foata normal form. 4/1684 useless extension candidates. Maximal degree in co-relation 3348. Up to 537 conditions per place. [2025-01-09 21:33:04,863 INFO L140 encePairwiseOnDemand]: 478/480 looper letters, 0 selfloop transitions, 0 changer transitions 369/369 dead transitions. [2025-01-09 21:33:04,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 369 transitions, 934 flow [2025-01-09 21:33:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-01-09 21:33:04,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2025-01-09 21:33:04,865 INFO L175 Difference]: Start difference. First operand has 378 places, 370 transitions, 882 flow. Second operand 3 states and 1190 transitions. [2025-01-09 21:33:04,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 369 transitions, 934 flow [2025-01-09 21:33:04,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 369 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:04,869 INFO L231 Difference]: Finished difference. Result has 378 places, 0 transitions, 0 flow [2025-01-09 21:33:04,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=378, PETRI_TRANSITIONS=0} [2025-01-09 21:33:04,870 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -72 predicate places. [2025-01-09 21:33:04,871 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 0 transitions, 0 flow [2025-01-09 21:33:04,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.6666666666667) internal successors, (1187), 3 states have internal predecessors, (1187), 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:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (158 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (157 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (156 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (155 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (154 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (153 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (152 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (151 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (150 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (149 of 159 remaining) [2025-01-09 21:33:04,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (148 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (147 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (146 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (145 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (144 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (143 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (142 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (141 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (140 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (139 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (138 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (137 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (136 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (135 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (134 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (132 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (131 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (130 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (129 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (128 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (126 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (125 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (124 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (123 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (122 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (121 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (120 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (119 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (118 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (117 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (116 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (115 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (114 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 159 remaining) [2025-01-09 21:33:04,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 159 remaining) [2025-01-09 21:33:04,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (111 of 159 remaining) [2025-01-09 21:33:04,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (110 of 159 remaining) [2025-01-09 21:33:04,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (109 of 159 remaining) [2025-01-09 21:33:04,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (108 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (107 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (106 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (105 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (104 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (103 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (102 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (101 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (100 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (99 of 159 remaining) [2025-01-09 21:33:04,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (98 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (97 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (96 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (95 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (93 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (92 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (91 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (90 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (89 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (88 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (87 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (86 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (85 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (84 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (83 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (82 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (81 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (80 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (79 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (78 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (77 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (75 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (74 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (73 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (72 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (71 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (70 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (69 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (64 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (63 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (62 of 159 remaining) [2025-01-09 21:33:04,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (61 of 159 remaining) [2025-01-09 21:33:04,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (60 of 159 remaining) [2025-01-09 21:33:04,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (59 of 159 remaining) [2025-01-09 21:33:04,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (58 of 159 remaining) [2025-01-09 21:33:04,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (57 of 159 remaining) [2025-01-09 21:33:04,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (48 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (46 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (45 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (44 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (43 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (42 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (41 of 159 remaining) [2025-01-09 21:33:04,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (40 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (39 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (38 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (37 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (36 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (31 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 159 remaining) [2025-01-09 21:33:04,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (13 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (12 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (11 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (8 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (6 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (3 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (2 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (1 of 159 remaining) [2025-01-09 21:33:04,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 159 remaining) [2025-01-09 21:33:04,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:33:04,883 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:04,889 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:04,889 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:04,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:04 BasicIcfg [2025-01-09 21:33:04,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:04,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:04,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:04,896 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:04,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:55" (3/4) ... [2025-01-09 21:33:04,898 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:04,899 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:04,900 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:04,901 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:04,907 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-01-09 21:33:04,907 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:04,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:04,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:04,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:04,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:04,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:04,981 INFO L158 Benchmark]: Toolchain (without parser) took 11128.35ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 110.6MB in the beginning and 422.4MB in the end (delta: -311.8MB). Peak memory consumption was 242.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:04,981 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:04,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.90ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 95.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:04,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.94ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 91.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:04,983 INFO L158 Benchmark]: Boogie Preprocessor took 48.98ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:04,983 INFO L158 Benchmark]: RCFGBuilder took 1194.32ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 72.6MB in the end (delta: 17.0MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2025-01-09 21:33:04,983 INFO L158 Benchmark]: TraceAbstraction took 9550.33ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 71.8MB in the beginning and 430.8MB in the end (delta: -359.0MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:04,983 INFO L158 Benchmark]: Witness Printer took 84.82ms. Allocated memory is still 696.3MB. Free memory was 430.8MB in the beginning and 422.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:04,984 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.90ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 95.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.94ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 91.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.98ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1194.32ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 72.6MB in the end (delta: 17.0MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9550.33ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 71.8MB in the beginning and 430.8MB in the end (delta: -359.0MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. * Witness Printer took 84.82ms. Allocated memory is still 696.3MB. Free memory was 430.8MB in the beginning and 422.4MB 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: 50]: 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: 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: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: 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: 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: 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: 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: 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: 107]: 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: 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: 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: 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: 112]: 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: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: 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: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: 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, 599 locations, 159 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: 9.4s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1415 IncrementalHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 55 mSDtfsCounter, 1415 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=938occurred in iteration=0, InterpolantAutomatonStates: 90, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4540 NumberOfCodeBlocks, 4540 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4512 ConstructedInterpolants, 0 QuantifiedInterpolants, 4982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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 90 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:04,999 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