./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:51:38,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:51:38,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:51:38,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:51:38,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:51:38,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:51:38,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:51:38,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:51:38,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:51:38,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:51:38,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:51:38,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:51:38,887 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:51:38,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:51:38,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:51:38,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:51:38,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:38,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:51:38,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:51:38,891 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/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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2025-03-04 06:51:39,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:51:39,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:51:39,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:51:39,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:51:39,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:51:39,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-03-04 06:51:40,255 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d28fb3d0/8a90fd3c10c741cbaf50a0b40b72f8e9/FLAG9812df10d [2025-03-04 06:51:40,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:51:40,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-03-04 06:51:40,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d28fb3d0/8a90fd3c10c741cbaf50a0b40b72f8e9/FLAG9812df10d [2025-03-04 06:51:40,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d28fb3d0/8a90fd3c10c741cbaf50a0b40b72f8e9 [2025-03-04 06:51:40,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:51:40,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:51:40,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:40,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:51:40,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:51:40,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:40" (1/1) ... [2025-03-04 06:51:40,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57aca075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:40, skipping insertion in model container [2025-03-04 06:51:40,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:40" (1/1) ... [2025-03-04 06:51:40,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:51:40,947 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:40,948 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:40,948 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:40,949 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:40,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:40,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:51:41,027 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,027 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,028 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,028 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:41,083 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:51:41,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41 WrapperNode [2025-03-04 06:51:41,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:41,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:41,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:51:41,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:51:41,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,129 INFO L138 Inliner]: procedures = 279, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 360 [2025-03-04 06:51:41,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:41,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:51:41,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:51:41,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:51:41,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:51:41,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:51:41,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:51:41,177 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:51:41,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:41,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:41,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:51:41,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:51:41,229 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:51:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:51:41,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:51:41,230 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:51:41,352 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:51:41,353 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:51:41,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:51:41,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:51:41,946 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:51:41,946 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:51:41,972 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:51:41,972 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:51:41,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:41 BoogieIcfgContainer [2025-03-04 06:51:41,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:51:41,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:51:41,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:51:41,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:51:41,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:51:40" (1/3) ... [2025-03-04 06:51:41,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a13c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:41, skipping insertion in model container [2025-03-04 06:51:41,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (2/3) ... [2025-03-04 06:51:41,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a13c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:41, skipping insertion in model container [2025-03-04 06:51:41,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:41" (3/3) ... [2025-03-04 06:51:41,981 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2025-03-04 06:51:41,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:51:41,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_91-arrayloop2_racefree.i that has 2 procedures, 382 locations, 1 initial locations, 10 loop locations, and 19 error locations. [2025-03-04 06:51:41,996 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:51:42,088 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:51:42,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 401 transitions, 809 flow [2025-03-04 06:51:42,231 INFO L124 PetriNetUnfolderBase]: 19/431 cut-off events. [2025-03-04 06:51:42,236 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:51:42,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 431 events. 19/431 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 959 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 251. Up to 4 conditions per place. [2025-03-04 06:51:42,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 385 places, 401 transitions, 809 flow [2025-03-04 06:51:42,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 385 places, 401 transitions, 809 flow [2025-03-04 06:51:42,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:51:42,271 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;@7a3de3f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:51:42,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-04 06:51:42,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:51:42,296 INFO L124 PetriNetUnfolderBase]: 0/118 cut-off events. [2025-03-04 06:51:42,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:51:42,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:42,296 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] [2025-03-04 06:51:42,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:42,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1818822606, now seen corresponding path program 1 times [2025-03-04 06:51:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959351793] [2025-03-04 06:51:42,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:42,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:42,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 06:51:42,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 06:51:42,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:42,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959351793] [2025-03-04 06:51:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959351793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:43,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:43,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967888454] [2025-03-04 06:51:43,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:43,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:43,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:43,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:43,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:43,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 401 [2025-03-04 06:51:43,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 401 transitions, 809 flow. Second operand has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:43,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:43,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 401 [2025-03-04 06:51:43,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:43,959 INFO L124 PetriNetUnfolderBase]: 319/1593 cut-off events. [2025-03-04 06:51:43,959 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-03-04 06:51:43,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1593 events. 319/1593 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10011 event pairs, 288 based on Foata normal form. 77/1540 useless extension candidates. Maximal degree in co-relation 1963. Up to 674 conditions per place. [2025-03-04 06:51:43,992 INFO L140 encePairwiseOnDemand]: 376/401 looper letters, 80 selfloop transitions, 10 changer transitions 0/384 dead transitions. [2025-03-04 06:51:43,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 384 transitions, 955 flow [2025-03-04 06:51:43,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1875 transitions. [2025-03-04 06:51:44,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7793017456359103 [2025-03-04 06:51:44,012 INFO L175 Difference]: Start difference. First operand has 385 places, 401 transitions, 809 flow. Second operand 6 states and 1875 transitions. [2025-03-04 06:51:44,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 384 transitions, 955 flow [2025-03-04 06:51:44,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 384 transitions, 955 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:44,022 INFO L231 Difference]: Finished difference. Result has 386 places, 384 transitions, 795 flow [2025-03-04 06:51:44,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=795, PETRI_PLACES=386, PETRI_TRANSITIONS=384} [2025-03-04 06:51:44,028 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 1 predicate places. [2025-03-04 06:51:44,029 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 384 transitions, 795 flow [2025-03-04 06:51:44,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:44,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:44,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:44,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:51:44,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:44,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2140736471, now seen corresponding path program 1 times [2025-03-04 06:51:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:44,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550874854] [2025-03-04 06:51:44,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:44,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:51:44,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:51:44,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:44,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:44,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550874854] [2025-03-04 06:51:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550874854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:44,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125210414] [2025-03-04 06:51:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:44,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:44,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:44,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:44,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 401 [2025-03-04 06:51:44,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 384 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-03-04 06:51:44,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:44,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 401 [2025-03-04 06:51:44,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:44,208 INFO L124 PetriNetUnfolderBase]: 15/564 cut-off events. [2025-03-04 06:51:44,209 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:51:44,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 564 events. 15/564 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1680 event pairs, 8 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 402. Up to 34 conditions per place. [2025-03-04 06:51:44,211 INFO L140 encePairwiseOnDemand]: 398/401 looper letters, 15 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-03-04 06:51:44,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 385 transitions, 831 flow [2025-03-04 06:51:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-03-04 06:51:44,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940149625935162 [2025-03-04 06:51:44,213 INFO L175 Difference]: Start difference. First operand has 386 places, 384 transitions, 795 flow. Second operand 3 states and 1131 transitions. [2025-03-04 06:51:44,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 385 transitions, 831 flow [2025-03-04 06:51:44,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 385 transitions, 811 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:44,221 INFO L231 Difference]: Finished difference. Result has 384 places, 385 transitions, 787 flow [2025-03-04 06:51:44,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=384, PETRI_TRANSITIONS=385} [2025-03-04 06:51:44,223 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -1 predicate places. [2025-03-04 06:51:44,223 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 385 transitions, 787 flow [2025-03-04 06:51:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-03-04 06:51:44,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:44,224 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] [2025-03-04 06:51:44,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:51:44,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1993860760, now seen corresponding path program 1 times [2025-03-04 06:51:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:44,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421743654] [2025-03-04 06:51:44,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:44,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:51:44,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:51:44,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:44,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:44,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421743654] [2025-03-04 06:51:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421743654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:44,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:44,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001314558] [2025-03-04 06:51:44,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:44,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:44,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:44,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:44,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 401 [2025-03-04 06:51:44,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 385 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:44,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:44,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 401 [2025-03-04 06:51:44,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:45,141 INFO L124 PetriNetUnfolderBase]: 320/1715 cut-off events. [2025-03-04 06:51:45,141 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-04 06:51:45,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 1715 events. 320/1715 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10756 event pairs, 288 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 2192. Up to 708 conditions per place. [2025-03-04 06:51:45,148 INFO L140 encePairwiseOnDemand]: 389/401 looper letters, 80 selfloop transitions, 10 changer transitions 0/383 dead transitions. [2025-03-04 06:51:45,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 383 transitions, 963 flow [2025-03-04 06:51:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1862 transitions. [2025-03-04 06:51:45,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7738985868661679 [2025-03-04 06:51:45,152 INFO L175 Difference]: Start difference. First operand has 384 places, 385 transitions, 787 flow. Second operand 6 states and 1862 transitions. [2025-03-04 06:51:45,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 383 transitions, 963 flow [2025-03-04 06:51:45,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 383 transitions, 961 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:45,157 INFO L231 Difference]: Finished difference. Result has 386 places, 383 transitions, 801 flow [2025-03-04 06:51:45,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=386, PETRI_TRANSITIONS=383} [2025-03-04 06:51:45,158 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 1 predicate places. [2025-03-04 06:51:45,159 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 383 transitions, 801 flow [2025-03-04 06:51:45,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:45,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:45,160 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-03-04 06:51:45,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:51:45,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:45,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2075868690, now seen corresponding path program 1 times [2025-03-04 06:51:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:45,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872230633] [2025-03-04 06:51:45,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:45,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 06:51:45,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 06:51:45,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:45,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:45,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872230633] [2025-03-04 06:51:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872230633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:45,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:45,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449124981] [2025-03-04 06:51:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:45,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:45,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:45,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:45,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 401 [2025-03-04 06:51:45,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 383 transitions, 801 flow. Second operand has 6 states, 6 states have (on average 296.6666666666667) internal successors, (1780), 6 states have internal predecessors, (1780), 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-03-04 06:51:45,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:45,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 401 [2025-03-04 06:51:45,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:46,214 INFO L124 PetriNetUnfolderBase]: 320/1713 cut-off events. [2025-03-04 06:51:46,214 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:46,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2477 conditions, 1713 events. 320/1713 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10730 event pairs, 288 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 2092. Up to 722 conditions per place. [2025-03-04 06:51:46,221 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 87 selfloop transitions, 5 changer transitions 0/382 dead transitions. [2025-03-04 06:51:46,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 382 transitions, 983 flow [2025-03-04 06:51:46,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1857 transitions. [2025-03-04 06:51:46,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7718204488778054 [2025-03-04 06:51:46,225 INFO L175 Difference]: Start difference. First operand has 386 places, 383 transitions, 801 flow. Second operand 6 states and 1857 transitions. [2025-03-04 06:51:46,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 382 transitions, 983 flow [2025-03-04 06:51:46,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 382 transitions, 963 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:46,230 INFO L231 Difference]: Finished difference. Result has 385 places, 382 transitions, 789 flow [2025-03-04 06:51:46,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=385, PETRI_TRANSITIONS=382} [2025-03-04 06:51:46,232 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 0 predicate places. [2025-03-04 06:51:46,232 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 382 transitions, 789 flow [2025-03-04 06:51:46,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.6666666666667) internal successors, (1780), 6 states have internal predecessors, (1780), 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-03-04 06:51:46,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:51:46,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:51:46,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:46,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1176528823, now seen corresponding path program 1 times [2025-03-04 06:51:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930284762] [2025-03-04 06:51:46,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:46,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 06:51:46,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 06:51:46,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:46,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:46,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930284762] [2025-03-04 06:51:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930284762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:46,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458595419] [2025-03-04 06:51:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:46,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:46,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:46,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:46,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 401 [2025-03-04 06:51:46,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 382 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-03-04 06:51:46,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:46,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 401 [2025-03-04 06:51:46,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:46,414 INFO L124 PetriNetUnfolderBase]: 15/746 cut-off events. [2025-03-04 06:51:46,415 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:51:46,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 746 events. 15/746 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1635 event pairs, 8 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 593. Up to 38 conditions per place. [2025-03-04 06:51:46,418 INFO L140 encePairwiseOnDemand]: 398/401 looper letters, 15 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-04 06:51:46,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 383 transitions, 825 flow [2025-03-04 06:51:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-03-04 06:51:46,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940149625935162 [2025-03-04 06:51:46,423 INFO L175 Difference]: Start difference. First operand has 385 places, 382 transitions, 789 flow. Second operand 3 states and 1131 transitions. [2025-03-04 06:51:46,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 383 transitions, 825 flow [2025-03-04 06:51:46,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 383 transitions, 815 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:46,428 INFO L231 Difference]: Finished difference. Result has 383 places, 383 transitions, 791 flow [2025-03-04 06:51:46,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=383, PETRI_TRANSITIONS=383} [2025-03-04 06:51:46,429 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -2 predicate places. [2025-03-04 06:51:46,429 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 383 transitions, 791 flow [2025-03-04 06:51:46,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-03-04 06:51:46,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:46,430 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] [2025-03-04 06:51:46,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:51:46,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:46,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1851148512, now seen corresponding path program 1 times [2025-03-04 06:51:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791935493] [2025-03-04 06:51:46,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:46,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 06:51:46,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 06:51:46,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:46,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:46,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:46,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791935493] [2025-03-04 06:51:46,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791935493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:46,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:46,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:46,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846331679] [2025-03-04 06:51:46,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:46,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:46,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:46,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:46,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:47,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 401 [2025-03-04 06:51:47,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 383 transitions, 791 flow. Second operand has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:47,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:47,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 401 [2025-03-04 06:51:47,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:47,497 INFO L124 PetriNetUnfolderBase]: 83/1056 cut-off events. [2025-03-04 06:51:47,498 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-04 06:51:47,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 1056 events. 83/1056 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3645 event pairs, 64 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 877. Up to 311 conditions per place. [2025-03-04 06:51:47,502 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 62 selfloop transitions, 5 changer transitions 0/382 dead transitions. [2025-03-04 06:51:47,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 382 transitions, 923 flow [2025-03-04 06:51:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1982 transitions. [2025-03-04 06:51:47,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8237738985868661 [2025-03-04 06:51:47,506 INFO L175 Difference]: Start difference. First operand has 383 places, 383 transitions, 791 flow. Second operand 6 states and 1982 transitions. [2025-03-04 06:51:47,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 382 transitions, 923 flow [2025-03-04 06:51:47,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 382 transitions, 921 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:47,513 INFO L231 Difference]: Finished difference. Result has 386 places, 382 transitions, 797 flow [2025-03-04 06:51:47,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=386, PETRI_TRANSITIONS=382} [2025-03-04 06:51:47,515 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 1 predicate places. [2025-03-04 06:51:47,515 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 382 transitions, 797 flow [2025-03-04 06:51:47,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:47,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:47,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] [2025-03-04 06:51:47,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:51:47,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:47,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:47,517 INFO L85 PathProgramCache]: Analyzing trace with hash 664473902, now seen corresponding path program 1 times [2025-03-04 06:51:47,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:47,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279358540] [2025-03-04 06:51:47,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:47,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:47,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 06:51:47,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 06:51:47,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:47,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279358540] [2025-03-04 06:51:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279358540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261149879] [2025-03-04 06:51:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:47,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:47,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:48,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 401 [2025-03-04 06:51:48,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 382 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 299.3333333333333) internal successors, (1796), 6 states have internal predecessors, (1796), 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-03-04 06:51:48,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:48,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 401 [2025-03-04 06:51:48,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:48,557 INFO L124 PetriNetUnfolderBase]: 320/1893 cut-off events. [2025-03-04 06:51:48,557 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:48,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1893 events. 320/1893 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10642 event pairs, 288 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2236. Up to 788 conditions per place. [2025-03-04 06:51:48,566 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 87 selfloop transitions, 5 changer transitions 0/381 dead transitions. [2025-03-04 06:51:48,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 381 transitions, 979 flow [2025-03-04 06:51:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1857 transitions. [2025-03-04 06:51:48,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7718204488778054 [2025-03-04 06:51:48,570 INFO L175 Difference]: Start difference. First operand has 386 places, 382 transitions, 797 flow. Second operand 6 states and 1857 transitions. [2025-03-04 06:51:48,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 381 transitions, 979 flow [2025-03-04 06:51:48,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 381 transitions, 969 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:48,575 INFO L231 Difference]: Finished difference. Result has 385 places, 381 transitions, 795 flow [2025-03-04 06:51:48,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=795, PETRI_PLACES=385, PETRI_TRANSITIONS=381} [2025-03-04 06:51:48,576 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 0 predicate places. [2025-03-04 06:51:48,576 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 381 transitions, 795 flow [2025-03-04 06:51:48,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.3333333333333) internal successors, (1796), 6 states have internal predecessors, (1796), 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-03-04 06:51:48,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:48,578 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] [2025-03-04 06:51:48,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:51:48,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:48,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 200467919, now seen corresponding path program 1 times [2025-03-04 06:51:48,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:48,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099137443] [2025-03-04 06:51:48,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:48,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 06:51:48,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 06:51:48,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:48,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099137443] [2025-03-04 06:51:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099137443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:48,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:48,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633063517] [2025-03-04 06:51:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:48,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:48,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:48,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:48,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:49,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 401 [2025-03-04 06:51:49,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 381 transitions, 795 flow. Second operand has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 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-03-04 06:51:49,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:49,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 401 [2025-03-04 06:51:49,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:49,421 INFO L124 PetriNetUnfolderBase]: 320/1889 cut-off events. [2025-03-04 06:51:49,421 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:49,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 1889 events. 320/1889 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10635 event pairs, 288 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2252. Up to 772 conditions per place. [2025-03-04 06:51:49,429 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 83 selfloop transitions, 5 changer transitions 0/380 dead transitions. [2025-03-04 06:51:49,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 380 transitions, 969 flow [2025-03-04 06:51:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1877 transitions. [2025-03-04 06:51:49,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7801330008312551 [2025-03-04 06:51:49,432 INFO L175 Difference]: Start difference. First operand has 385 places, 381 transitions, 795 flow. Second operand 6 states and 1877 transitions. [2025-03-04 06:51:49,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 380 transitions, 969 flow [2025-03-04 06:51:49,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 380 transitions, 959 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:49,438 INFO L231 Difference]: Finished difference. Result has 384 places, 380 transitions, 793 flow [2025-03-04 06:51:49,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=793, PETRI_PLACES=384, PETRI_TRANSITIONS=380} [2025-03-04 06:51:49,439 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -1 predicate places. [2025-03-04 06:51:49,439 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 380 transitions, 793 flow [2025-03-04 06:51:49,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 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-03-04 06:51:49,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:49,440 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] [2025-03-04 06:51:49,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:51:49,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:49,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 670185604, now seen corresponding path program 1 times [2025-03-04 06:51:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017266971] [2025-03-04 06:51:49,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:49,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 06:51:49,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:51:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:49,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:49,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:49,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017266971] [2025-03-04 06:51:49,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017266971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:49,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:49,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752187180] [2025-03-04 06:51:49,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:49,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:49,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:49,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:50,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 401 [2025-03-04 06:51:50,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 380 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 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-03-04 06:51:50,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:50,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 401 [2025-03-04 06:51:50,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:50,454 INFO L124 PetriNetUnfolderBase]: 320/1885 cut-off events. [2025-03-04 06:51:50,454 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-04 06:51:50,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 1885 events. 320/1885 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10598 event pairs, 288 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2267. Up to 772 conditions per place. [2025-03-04 06:51:50,462 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 83 selfloop transitions, 5 changer transitions 0/379 dead transitions. [2025-03-04 06:51:50,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 379 transitions, 967 flow [2025-03-04 06:51:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1877 transitions. [2025-03-04 06:51:50,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7801330008312551 [2025-03-04 06:51:50,466 INFO L175 Difference]: Start difference. First operand has 384 places, 380 transitions, 793 flow. Second operand 6 states and 1877 transitions. [2025-03-04 06:51:50,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 379 transitions, 967 flow [2025-03-04 06:51:50,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 379 transitions, 957 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:50,472 INFO L231 Difference]: Finished difference. Result has 383 places, 379 transitions, 791 flow [2025-03-04 06:51:50,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=383, PETRI_TRANSITIONS=379} [2025-03-04 06:51:50,473 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -2 predicate places. [2025-03-04 06:51:50,473 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 379 transitions, 791 flow [2025-03-04 06:51:50,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 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-03-04 06:51:50,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:50,475 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-03-04 06:51:50,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:51:50,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:50,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:50,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1332645664, now seen corresponding path program 1 times [2025-03-04 06:51:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866873052] [2025-03-04 06:51:50,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:50,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 06:51:50,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 06:51:50,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:50,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:51:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866873052] [2025-03-04 06:51:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866873052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403963170] [2025-03-04 06:51:50,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:50,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:50,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:50,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:51,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 401 [2025-03-04 06:51:51,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 379 transitions, 791 flow. Second operand has 6 states, 6 states have (on average 300.5) internal successors, (1803), 6 states have internal predecessors, (1803), 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-03-04 06:51:51,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:51,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 401 [2025-03-04 06:51:51,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:51,336 INFO L124 PetriNetUnfolderBase]: 320/1881 cut-off events. [2025-03-04 06:51:51,336 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:51,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2734 conditions, 1881 events. 320/1881 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10596 event pairs, 288 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2280. Up to 792 conditions per place. [2025-03-04 06:51:51,345 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 88 selfloop transitions, 5 changer transitions 0/378 dead transitions. [2025-03-04 06:51:51,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 378 transitions, 975 flow [2025-03-04 06:51:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1852 transitions. [2025-03-04 06:51:51,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.769742310889443 [2025-03-04 06:51:51,350 INFO L175 Difference]: Start difference. First operand has 383 places, 379 transitions, 791 flow. Second operand 6 states and 1852 transitions. [2025-03-04 06:51:51,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 378 transitions, 975 flow [2025-03-04 06:51:51,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 378 transitions, 965 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:51,356 INFO L231 Difference]: Finished difference. Result has 382 places, 378 transitions, 789 flow [2025-03-04 06:51:51,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=382, PETRI_TRANSITIONS=378} [2025-03-04 06:51:51,358 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -3 predicate places. [2025-03-04 06:51:51,358 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 378 transitions, 789 flow [2025-03-04 06:51:51,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.5) internal successors, (1803), 6 states have internal predecessors, (1803), 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-03-04 06:51:51,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:51,360 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] [2025-03-04 06:51:51,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:51:51,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:51,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:51,361 INFO L85 PathProgramCache]: Analyzing trace with hash 842573375, now seen corresponding path program 1 times [2025-03-04 06:51:51,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:51,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56683351] [2025-03-04 06:51:51,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:51,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:51,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 06:51:51,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 06:51:51,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:51,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:51:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:51,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56683351] [2025-03-04 06:51:51,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56683351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:51:51,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080577824] [2025-03-04 06:51:51,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:51,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:51,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:51:51,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:51:51,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 06:51:51,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 06:51:51,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:51,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:51,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:51:51,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:51:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:51:51,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:51:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:51:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080577824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:51:51,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:51:51,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:51:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868926420] [2025-03-04 06:51:51,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:51:51,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:51:51,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:51,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:51:51,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:51:52,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 401 [2025-03-04 06:51:52,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 378 transitions, 789 flow. Second operand has 10 states, 10 states have (on average 369.8) internal successors, (3698), 10 states have internal predecessors, (3698), 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-03-04 06:51:52,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:52,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 401 [2025-03-04 06:51:52,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:52,186 INFO L124 PetriNetUnfolderBase]: 15/910 cut-off events. [2025-03-04 06:51:52,186 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-04 06:51:52,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 15/910 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1048 event pairs, 8 based on Foata normal form. 4/888 useless extension candidates. Maximal degree in co-relation 799. Up to 38 conditions per place. [2025-03-04 06:51:52,189 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 19 selfloop transitions, 9 changer transitions 0/386 dead transitions. [2025-03-04 06:51:52,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 386 transitions, 863 flow [2025-03-04 06:51:52,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:51:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:51:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3342 transitions. [2025-03-04 06:51:52,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9260182876142976 [2025-03-04 06:51:52,195 INFO L175 Difference]: Start difference. First operand has 382 places, 378 transitions, 789 flow. Second operand 9 states and 3342 transitions. [2025-03-04 06:51:52,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 386 transitions, 863 flow [2025-03-04 06:51:52,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 386 transitions, 853 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:52,200 INFO L231 Difference]: Finished difference. Result has 388 places, 384 transitions, 829 flow [2025-03-04 06:51:52,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=829, PETRI_PLACES=388, PETRI_TRANSITIONS=384} [2025-03-04 06:51:52,202 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 3 predicate places. [2025-03-04 06:51:52,202 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 384 transitions, 829 flow [2025-03-04 06:51:52,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 369.8) internal successors, (3698), 10 states have internal predecessors, (3698), 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-03-04 06:51:52,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:52,204 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:52,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:51:52,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 06:51:52,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:52,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash 219878735, now seen corresponding path program 2 times [2025-03-04 06:51:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899519880] [2025-03-04 06:51:52,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:51:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:52,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 401 statements into 2 equivalence classes. [2025-03-04 06:51:52,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 401 statements. [2025-03-04 06:51:52,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:51:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-04 06:51:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899519880] [2025-03-04 06:51:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899519880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264150602] [2025-03-04 06:51:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:52,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:52,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:52,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:52,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 401 [2025-03-04 06:51:52,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 384 transitions, 829 flow. Second operand has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 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-03-04 06:51:52,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:52,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 401 [2025-03-04 06:51:52,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:53,659 INFO L124 PetriNetUnfolderBase]: 739/3465 cut-off events. [2025-03-04 06:51:53,659 INFO L125 PetriNetUnfolderBase]: For 30/44 co-relation queries the response was YES. [2025-03-04 06:51:53,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5232 conditions, 3465 events. 739/3465 cut-off events. For 30/44 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 22458 event pairs, 323 based on Foata normal form. 4/3220 useless extension candidates. Maximal degree in co-relation 4568. Up to 1429 conditions per place. [2025-03-04 06:51:53,673 INFO L140 encePairwiseOnDemand]: 366/401 looper letters, 127 selfloop transitions, 118 changer transitions 0/533 dead transitions. [2025-03-04 06:51:53,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 533 transitions, 1617 flow [2025-03-04 06:51:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1992 transitions. [2025-03-04 06:51:53,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.827930174563591 [2025-03-04 06:51:53,677 INFO L175 Difference]: Start difference. First operand has 388 places, 384 transitions, 829 flow. Second operand 6 states and 1992 transitions. [2025-03-04 06:51:53,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 533 transitions, 1617 flow [2025-03-04 06:51:53,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 533 transitions, 1611 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:53,686 INFO L231 Difference]: Finished difference. Result has 397 places, 501 transitions, 1597 flow [2025-03-04 06:51:53,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1597, PETRI_PLACES=397, PETRI_TRANSITIONS=501} [2025-03-04 06:51:53,689 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 12 predicate places. [2025-03-04 06:51:53,689 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 501 transitions, 1597 flow [2025-03-04 06:51:53,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 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-03-04 06:51:53,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:53,691 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:53,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:51:53,691 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:53,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:53,692 INFO L85 PathProgramCache]: Analyzing trace with hash 743301452, now seen corresponding path program 1 times [2025-03-04 06:51:53,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996843485] [2025-03-04 06:51:53,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:53,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:53,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-04 06:51:53,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-04 06:51:53,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:53,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-04 06:51:54,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:54,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996843485] [2025-03-04 06:51:54,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996843485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:51:54,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928099162] [2025-03-04 06:51:54,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:54,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:54,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:54,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:51:54,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:51:54,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-04 06:51:54,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-04 06:51:54,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:54,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:54,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 06:51:54,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:51:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 06:51:54,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:51:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928099162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:54,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:51:54,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-04 06:51:54,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570092111] [2025-03-04 06:51:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:54,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:54,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:54,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:54,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 401 [2025-03-04 06:51:54,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 501 transitions, 1597 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-03-04 06:51:54,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:54,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 401 [2025-03-04 06:51:54,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:54,630 INFO L124 PetriNetUnfolderBase]: 280/2138 cut-off events. [2025-03-04 06:51:54,630 INFO L125 PetriNetUnfolderBase]: For 209/251 co-relation queries the response was YES. [2025-03-04 06:51:54,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2138 events. 280/2138 cut-off events. For 209/251 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10883 event pairs, 24 based on Foata normal form. 2/2013 useless extension candidates. Maximal degree in co-relation 2676. Up to 340 conditions per place. [2025-03-04 06:51:54,640 INFO L140 encePairwiseOnDemand]: 398/401 looper letters, 22 selfloop transitions, 3 changer transitions 0/509 dead transitions. [2025-03-04 06:51:54,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 509 transitions, 1663 flow [2025-03-04 06:51:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2025-03-04 06:51:54,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9459684123025769 [2025-03-04 06:51:54,643 INFO L175 Difference]: Start difference. First operand has 397 places, 501 transitions, 1597 flow. Second operand 3 states and 1138 transitions. [2025-03-04 06:51:54,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 509 transitions, 1663 flow [2025-03-04 06:51:54,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 509 transitions, 1663 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:54,652 INFO L231 Difference]: Finished difference. Result has 400 places, 501 transitions, 1608 flow [2025-03-04 06:51:54,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1608, PETRI_PLACES=400, PETRI_TRANSITIONS=501} [2025-03-04 06:51:54,653 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 15 predicate places. [2025-03-04 06:51:54,653 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 501 transitions, 1608 flow [2025-03-04 06:51:54,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-03-04 06:51:54,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:54,654 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:54,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:51:54,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 06:51:54,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:54,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1846025338, now seen corresponding path program 1 times [2025-03-04 06:51:54,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:54,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280937101] [2025-03-04 06:51:54,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:54,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:54,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-04 06:51:54,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-04 06:51:54,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:54,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-04 06:51:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280937101] [2025-03-04 06:51:55,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280937101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:51:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110330077] [2025-03-04 06:51:55,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:55,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:55,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:55,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:51:55,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:51:55,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-04 06:51:55,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-04 06:51:55,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:55,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:55,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:51:55,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:51:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 06:51:55,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:51:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 06:51:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110330077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:51:56,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:51:56,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 06:51:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619025079] [2025-03-04 06:51:56,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:51:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 06:51:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:56,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 06:51:56,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 06:51:56,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 401 [2025-03-04 06:51:56,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 501 transitions, 1608 flow. Second operand has 19 states, 19 states have (on average 364.57894736842104) internal successors, (6927), 19 states have internal predecessors, (6927), 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-03-04 06:51:56,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:56,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 401 [2025-03-04 06:51:56,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:57,482 INFO L124 PetriNetUnfolderBase]: 262/3390 cut-off events. [2025-03-04 06:51:57,482 INFO L125 PetriNetUnfolderBase]: For 241/263 co-relation queries the response was YES. [2025-03-04 06:51:57,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4649 conditions, 3390 events. 262/3390 cut-off events. For 241/263 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9516 event pairs, 8 based on Foata normal form. 13/3307 useless extension candidates. Maximal degree in co-relation 2550. Up to 345 conditions per place. [2025-03-04 06:51:57,494 INFO L140 encePairwiseOnDemand]: 390/401 looper letters, 51 selfloop transitions, 68 changer transitions 0/587 dead transitions. [2025-03-04 06:51:57,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 587 transitions, 2256 flow [2025-03-04 06:51:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 06:51:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-04 06:51:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 22938 transitions. [2025-03-04 06:51:57,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079681748010925 [2025-03-04 06:51:57,510 INFO L175 Difference]: Start difference. First operand has 400 places, 501 transitions, 1608 flow. Second operand 63 states and 22938 transitions. [2025-03-04 06:51:57,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 587 transitions, 2256 flow [2025-03-04 06:51:57,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 587 transitions, 2250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:51:57,518 INFO L231 Difference]: Finished difference. Result has 476 places, 563 transitions, 2122 flow [2025-03-04 06:51:57,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=2122, PETRI_PLACES=476, PETRI_TRANSITIONS=563} [2025-03-04 06:51:57,519 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 91 predicate places. [2025-03-04 06:51:57,519 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 563 transitions, 2122 flow [2025-03-04 06:51:57,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 364.57894736842104) internal successors, (6927), 19 states have internal predecessors, (6927), 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-03-04 06:51:57,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:57,522 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:57,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:51:57,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:57,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:57,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1498501630, now seen corresponding path program 2 times [2025-03-04 06:51:57,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:57,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854298140] [2025-03-04 06:51:57,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:51:57,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:57,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1434 statements into 2 equivalence classes. [2025-03-04 06:51:57,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 1434 statements. [2025-03-04 06:51:57,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:51:57,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10209 trivial. 0 not checked. [2025-03-04 06:51:57,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854298140] [2025-03-04 06:51:57,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854298140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:57,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788212337] [2025-03-04 06:51:57,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:57,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:51:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:57,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:51:57,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:51:58,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 401 [2025-03-04 06:51:58,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 563 transitions, 2122 flow. Second operand has 5 states, 5 states have (on average 370.6) internal successors, (1853), 5 states have internal predecessors, (1853), 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-03-04 06:51:58,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:58,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 401 [2025-03-04 06:51:58,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:58,814 INFO L124 PetriNetUnfolderBase]: 303/3555 cut-off events. [2025-03-04 06:51:58,814 INFO L125 PetriNetUnfolderBase]: For 626/652 co-relation queries the response was YES. [2025-03-04 06:51:58,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5027 conditions, 3555 events. 303/3555 cut-off events. For 626/652 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10493 event pairs, 0 based on Foata normal form. 9/3461 useless extension candidates. Maximal degree in co-relation 3376. Up to 369 conditions per place. [2025-03-04 06:51:58,823 INFO L140 encePairwiseOnDemand]: 396/401 looper letters, 34 selfloop transitions, 5 changer transitions 0/564 dead transitions. [2025-03-04 06:51:58,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 564 transitions, 2197 flow [2025-03-04 06:51:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2253 transitions. [2025-03-04 06:51:58,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364089775561097 [2025-03-04 06:51:58,824 INFO L175 Difference]: Start difference. First operand has 476 places, 563 transitions, 2122 flow. Second operand 6 states and 2253 transitions. [2025-03-04 06:51:58,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 564 transitions, 2197 flow [2025-03-04 06:51:58,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 564 transitions, 2118 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-03-04 06:51:58,836 INFO L231 Difference]: Finished difference. Result has 451 places, 540 transitions, 2002 flow [2025-03-04 06:51:58,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2002, PETRI_PLACES=451, PETRI_TRANSITIONS=540} [2025-03-04 06:51:58,837 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 66 predicate places. [2025-03-04 06:51:58,837 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 540 transitions, 2002 flow [2025-03-04 06:51:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 370.6) internal successors, (1853), 5 states have internal predecessors, (1853), 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-03-04 06:51:58,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:58,839 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:58,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:51:58,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:51:58,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1744855629, now seen corresponding path program 1 times [2025-03-04 06:51:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741803893] [2025-03-04 06:51:58,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:58,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:58,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1435 statements into 1 equivalence classes. [2025-03-04 06:51:59,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1435 of 1435 statements. [2025-03-04 06:51:59,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:59,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-03-04 06:52:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741803893] [2025-03-04 06:52:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741803893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685555035] [2025-03-04 06:52:01,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:01,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:01,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:01,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:52:01,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:52:01,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1435 statements into 1 equivalence classes. [2025-03-04 06:52:02,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1435 of 1435 statements. [2025-03-04 06:52:02,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:02,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:02,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 5693 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:52:02,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-03-04 06:52:02,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-03-04 06:52:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685555035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:03,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:03,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 06:52:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490204331] [2025-03-04 06:52:03,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:03,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:52:03,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:03,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:52:03,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:52:03,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 401 [2025-03-04 06:52:03,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 540 transitions, 2002 flow. Second operand has 34 states, 34 states have (on average 370.1470588235294) internal successors, (12585), 34 states have internal predecessors, (12585), 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-03-04 06:52:03,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:03,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 401 [2025-03-04 06:52:03,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:05,857 INFO L124 PetriNetUnfolderBase]: 251/5484 cut-off events. [2025-03-04 06:52:05,858 INFO L125 PetriNetUnfolderBase]: For 3363/3384 co-relation queries the response was YES. [2025-03-04 06:52:05,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7217 conditions, 5484 events. 251/5484 cut-off events. For 3363/3384 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8878 event pairs, 0 based on Foata normal form. 24/5423 useless extension candidates. Maximal degree in co-relation 4986. Up to 345 conditions per place. [2025-03-04 06:52:05,871 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 49 selfloop transitions, 135 changer transitions 0/641 dead transitions. [2025-03-04 06:52:05,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 641 transitions, 3134 flow [2025-03-04 06:52:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 06:52:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 06:52:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16642 transitions. [2025-03-04 06:52:05,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9222499307287337 [2025-03-04 06:52:05,882 INFO L175 Difference]: Start difference. First operand has 451 places, 540 transitions, 2002 flow. Second operand 45 states and 16642 transitions. [2025-03-04 06:52:05,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 641 transitions, 3134 flow [2025-03-04 06:52:05,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 641 transitions, 3125 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:52:05,896 INFO L231 Difference]: Finished difference. Result has 500 places, 615 transitions, 2867 flow [2025-03-04 06:52:05,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=1993, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2867, PETRI_PLACES=500, PETRI_TRANSITIONS=615} [2025-03-04 06:52:05,897 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 115 predicate places. [2025-03-04 06:52:05,897 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 615 transitions, 2867 flow [2025-03-04 06:52:05,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 370.1470588235294) internal successors, (12585), 34 states have internal predecessors, (12585), 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-03-04 06:52:05,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:05,901 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:05,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:52:06,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 06:52:06,101 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:52:06,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1331059277, now seen corresponding path program 2 times [2025-03-04 06:52:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864652452] [2025-03-04 06:52:06,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:52:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:06,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2875 statements into 2 equivalence classes. [2025-03-04 06:52:06,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2875 of 2875 statements. [2025-03-04 06:52:06,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:52:06,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-03-04 06:52:16,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864652452] [2025-03-04 06:52:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864652452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762982025] [2025-03-04 06:52:16,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:52:16,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:16,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:52:16,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 06:52:17,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2875 statements into 2 equivalence classes. [2025-03-04 06:52:18,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2875 of 2875 statements. [2025-03-04 06:52:18,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:52:18,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:18,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 11581 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:52:18,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-03-04 06:52:19,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-03-04 06:52:20,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762982025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:20,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:20,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-04 06:52:20,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021290000] [2025-03-04 06:52:20,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:20,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 06:52:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:20,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 06:52:20,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 06:52:21,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 401 [2025-03-04 06:52:21,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 615 transitions, 2867 flow. Second operand has 63 states, 63 states have (on average 370.1111111111111) internal successors, (23317), 63 states have internal predecessors, (23317), 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-03-04 06:52:21,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:21,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 401 [2025-03-04 06:52:21,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:27,583 INFO L124 PetriNetUnfolderBase]: 251/9534 cut-off events. [2025-03-04 06:52:27,584 INFO L125 PetriNetUnfolderBase]: For 13571/13592 co-relation queries the response was YES. [2025-03-04 06:52:27,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12435 conditions, 9534 events. 251/9534 cut-off events. For 13571/13592 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8865 event pairs, 0 based on Foata normal form. 45/9494 useless extension candidates. Maximal degree in co-relation 10199. Up to 345 conditions per place. [2025-03-04 06:52:27,615 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 94 selfloop transitions, 270 changer transitions 0/821 dead transitions. [2025-03-04 06:52:27,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 821 transitions, 5781 flow [2025-03-04 06:52:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 06:52:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-04 06:52:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 33269 transitions. [2025-03-04 06:52:27,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218343031310612 [2025-03-04 06:52:27,638 INFO L175 Difference]: Start difference. First operand has 500 places, 615 transitions, 2867 flow. Second operand 90 states and 33269 transitions. [2025-03-04 06:52:27,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 821 transitions, 5781 flow [2025-03-04 06:52:27,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 821 transitions, 5673 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-04 06:52:27,666 INFO L231 Difference]: Finished difference. Result has 587 places, 753 transitions, 4751 flow [2025-03-04 06:52:27,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=2759, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4751, PETRI_PLACES=587, PETRI_TRANSITIONS=753} [2025-03-04 06:52:27,666 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 202 predicate places. [2025-03-04 06:52:27,667 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 753 transitions, 4751 flow [2025-03-04 06:52:27,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 370.1111111111111) internal successors, (23317), 63 states have internal predecessors, (23317), 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-03-04 06:52:27,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:27,673 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:27,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 06:52:27,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 06:52:27,875 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:52:27,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1927061171, now seen corresponding path program 3 times [2025-03-04 06:52:27,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:27,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167359319] [2025-03-04 06:52:27,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:52:27,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:28,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5575 statements into 35 equivalence classes. [2025-03-04 06:52:28,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 231 of 5575 statements. [2025-03-04 06:52:28,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 06:52:28,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 195451 backedges. 0 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-03-04 06:52:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167359319] [2025-03-04 06:52:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167359319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472604157] [2025-03-04 06:52:28,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:52:28,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:28,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:28,744 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:52:28,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 06:52:30,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5575 statements into 35 equivalence classes. [2025-03-04 06:52:31,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 231 of 5575 statements. [2025-03-04 06:52:31,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 06:52:31,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:31,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 06:52:31,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 195451 backedges. 0 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-03-04 06:52:35,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 195451 backedges. 0 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-03-04 06:52:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472604157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:39,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:39,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 06:52:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047099850] [2025-03-04 06:52:39,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:39,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 06:52:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:39,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 06:52:39,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 06:52:39,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 401 [2025-03-04 06:52:39,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 753 transitions, 4751 flow. Second operand has 14 states, 14 states have (on average 369.92857142857144) internal successors, (5179), 14 states have internal predecessors, (5179), 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-03-04 06:52:39,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:39,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 401 [2025-03-04 06:52:39,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:56,938 INFO L124 PetriNetUnfolderBase]: 253/14996 cut-off events. [2025-03-04 06:52:56,939 INFO L125 PetriNetUnfolderBase]: For 6056/6077 co-relation queries the response was YES. [2025-03-04 06:52:56,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19185 conditions, 14996 events. 253/14996 cut-off events. For 6056/6077 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8079 event pairs, 0 based on Foata normal form. 3/14914 useless extension candidates. Maximal degree in co-relation 16933. Up to 345 conditions per place. [2025-03-04 06:52:56,975 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 19 selfloop transitions, 15 changer transitions 0/766 dead transitions. [2025-03-04 06:52:56,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 766 transitions, 4865 flow [2025-03-04 06:52:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:52:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 06:52:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5557 transitions. [2025-03-04 06:52:56,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9238570241064007 [2025-03-04 06:52:56,978 INFO L175 Difference]: Start difference. First operand has 587 places, 753 transitions, 4751 flow. Second operand 15 states and 5557 transitions. [2025-03-04 06:52:56,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 766 transitions, 4865 flow [2025-03-04 06:52:57,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 766 transitions, 4511 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-04 06:52:57,021 INFO L231 Difference]: Finished difference. Result has 563 places, 762 transitions, 4487 flow [2025-03-04 06:52:57,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=4397, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4487, PETRI_PLACES=563, PETRI_TRANSITIONS=762} [2025-03-04 06:52:57,022 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 178 predicate places. [2025-03-04 06:52:57,022 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 762 transitions, 4487 flow [2025-03-04 06:52:57,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 369.92857142857144) internal successors, (5179), 14 states have internal predecessors, (5179), 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-03-04 06:52:57,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:57,027 INFO L206 CegarLoopForPetriNet]: trace histogram [150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:57,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 06:52:57,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 06:52:57,228 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:52:57,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1177951363, now seen corresponding path program 4 times [2025-03-04 06:52:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:57,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131267262] [2025-03-04 06:52:57,269 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:52:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:58,575 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13762 statements into 2 equivalence classes. [2025-03-04 06:53:00,366 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13376 of 13762 statements. [2025-03-04 06:53:00,366 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:53:00,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat