./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:20,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:20,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:32:20,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:20,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:20,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:20,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:20,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:20,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:20,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:20,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:20,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:20,365 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:20,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:20,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:20,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:20,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:20,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:20,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:20,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:20,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:20,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:20,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:20,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:20,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:20,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:20,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:20,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:20,370 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 [2025-01-09 21:32:20,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:20,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:20,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:20,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:20,676 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:20,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2025-01-09 21:32:21,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d18760f67/6f46141e9bed4648bb429e530b5d91a1/FLAGc5af21afa [2025-01-09 21:32:22,253 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:22,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2025-01-09 21:32:22,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d18760f67/6f46141e9bed4648bb429e530b5d91a1/FLAGc5af21afa [2025-01-09 21:32:22,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d18760f67/6f46141e9bed4648bb429e530b5d91a1 [2025-01-09 21:32:22,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:22,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:22,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:22,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:22,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:22,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:22,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2bb324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22, skipping insertion in model container [2025-01-09 21:32:22,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:22,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:22,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:22,842 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:22,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:22,903 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:22,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22 WrapperNode [2025-01-09 21:32:22,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:22,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:22,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:22,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:22,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:22,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:22,982 INFO L138 Inliner]: procedures = 28, calls = 59, calls flagged for inlining = 23, calls inlined = 33, statements flattened = 629 [2025-01-09 21:32:22,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:22,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:22,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:22,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:22,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:22,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:23,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:23,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:23,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:23,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (1/1) ... [2025-01-09 21:32:23,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:23,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:32:23,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:32:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:32:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:32:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:23,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:23,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:23,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:32:23,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:32:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-09 21:32:23,134 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-09 21:32:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-01-09 21:32:23,134 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-01-09 21:32:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:32:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:32:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:32:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:23,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:23,136 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:32:23,309 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:23,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:24,201 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:24,202 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:24,686 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:24,686 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:32:24,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:24 BoogieIcfgContainer [2025-01-09 21:32:24,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:24,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:24,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:24,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:24,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:22" (1/3) ... [2025-01-09 21:32:24,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc259fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:24, skipping insertion in model container [2025-01-09 21:32:24,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:22" (2/3) ... [2025-01-09 21:32:24,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc259fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:24, skipping insertion in model container [2025-01-09 21:32:24,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:24" (3/3) ... [2025-01-09 21:32:24,698 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2025-01-09 21:32:24,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:24,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-2.wvr.c that has 7 procedures, 453 locations, 1 initial locations, 5 loop locations, and 83 error locations. [2025-01-09 21:32:24,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:24,862 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-01-09 21:32:24,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 513 places, 521 transitions, 1108 flow [2025-01-09 21:32:25,138 INFO L124 PetriNetUnfolderBase]: 25/471 cut-off events. [2025-01-09 21:32:25,141 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:32:25,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 471 events. 25/471 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 802 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 413. Up to 3 conditions per place. [2025-01-09 21:32:25,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 513 places, 521 transitions, 1108 flow [2025-01-09 21:32:25,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 454 transitions, 956 flow [2025-01-09 21:32:25,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:25,190 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;@58d07ba5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:25,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-01-09 21:32:25,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:25,197 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-01-09 21:32:25,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:25,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:25,200 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] [2025-01-09 21:32:25,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash 394511395, now seen corresponding path program 1 times [2025-01-09 21:32:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:25,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823755554] [2025-01-09 21:32:25,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:25,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:32:25,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:32:25,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:25,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823755554] [2025-01-09 21:32:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823755554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:25,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:25,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168773442] [2025-01-09 21:32:25,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:25,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:25,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:25,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:25,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-01-09 21:32:25,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 454 transitions, 956 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:25,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:25,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-01-09 21:32:25,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:26,663 INFO L124 PetriNetUnfolderBase]: 1344/4046 cut-off events. [2025-01-09 21:32:26,664 INFO L125 PetriNetUnfolderBase]: For 1080/1080 co-relation queries the response was YES. [2025-01-09 21:32:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6674 conditions, 4046 events. 1344/4046 cut-off events. For 1080/1080 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 30230 event pairs, 567 based on Foata normal form. 601/3895 useless extension candidates. Maximal degree in co-relation 6201. Up to 1698 conditions per place. [2025-01-09 21:32:26,702 INFO L140 encePairwiseOnDemand]: 462/525 looper letters, 31 selfloop transitions, 2 changer transitions 4/393 dead transitions. [2025-01-09 21:32:26,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 393 transitions, 900 flow [2025-01-09 21:32:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-01-09 21:32:26,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387301587301588 [2025-01-09 21:32:26,727 INFO L175 Difference]: Start difference. First operand has 449 places, 454 transitions, 956 flow. Second operand 3 states and 1321 transitions. [2025-01-09 21:32:26,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 393 transitions, 900 flow [2025-01-09 21:32:26,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 393 transitions, 868 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-09 21:32:26,752 INFO L231 Difference]: Finished difference. Result has 388 places, 389 transitions, 798 flow [2025-01-09 21:32:26,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=388, PETRI_TRANSITIONS=389} [2025-01-09 21:32:26,758 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -61 predicate places. [2025-01-09 21:32:26,758 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 389 transitions, 798 flow [2025-01-09 21:32:26,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:26,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:26,759 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] [2025-01-09 21:32:26,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:26,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:26,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1699379543, now seen corresponding path program 1 times [2025-01-09 21:32:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:26,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528004480] [2025-01-09 21:32:26,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:26,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:32:26,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:32:26,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:26,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528004480] [2025-01-09 21:32:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528004480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347913258] [2025-01-09 21:32:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:26,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:26,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:26,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:26,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-01-09 21:32:26,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 389 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:26,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:26,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-01-09 21:32:26,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,588 INFO L124 PetriNetUnfolderBase]: 1339/3943 cut-off events. [2025-01-09 21:32:27,589 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2025-01-09 21:32:27,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5795 conditions, 3943 events. 1339/3943 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29023 event pairs, 564 based on Foata normal form. 0/3219 useless extension candidates. Maximal degree in co-relation 5757. Up to 1692 conditions per place. [2025-01-09 21:32:27,624 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 31 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2025-01-09 21:32:27,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 388 transitions, 862 flow [2025-01-09 21:32:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2025-01-09 21:32:27,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8006349206349206 [2025-01-09 21:32:27,632 INFO L175 Difference]: Start difference. First operand has 388 places, 389 transitions, 798 flow. Second operand 3 states and 1261 transitions. [2025-01-09 21:32:27,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 388 transitions, 862 flow [2025-01-09 21:32:27,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 388 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:27,640 INFO L231 Difference]: Finished difference. Result has 383 places, 388 transitions, 796 flow [2025-01-09 21:32:27,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=383, PETRI_TRANSITIONS=388} [2025-01-09 21:32:27,641 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -66 predicate places. [2025-01-09 21:32:27,642 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 388 transitions, 796 flow [2025-01-09 21:32:27,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:27,643 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] [2025-01-09 21:32:27,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:27,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:27,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1658639311, now seen corresponding path program 1 times [2025-01-09 21:32:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034986319] [2025-01-09 21:32:27,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:27,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:32:27,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:32:27,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:27,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034986319] [2025-01-09 21:32:27,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034986319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629117221] [2025-01-09 21:32:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-01-09 21:32:27,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 388 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-01-09 21:32:27,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:28,522 INFO L124 PetriNetUnfolderBase]: 1292/3800 cut-off events. [2025-01-09 21:32:28,522 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:28,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 3800 events. 1292/3800 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27542 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5534. Up to 1624 conditions per place. [2025-01-09 21:32:28,552 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2025-01-09 21:32:28,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 387 transitions, 856 flow [2025-01-09 21:32:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-01-09 21:32:28,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-01-09 21:32:28,556 INFO L175 Difference]: Start difference. First operand has 383 places, 388 transitions, 796 flow. Second operand 3 states and 1268 transitions. [2025-01-09 21:32:28,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 387 transitions, 856 flow [2025-01-09 21:32:28,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 387 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:28,563 INFO L231 Difference]: Finished difference. Result has 382 places, 387 transitions, 794 flow [2025-01-09 21:32:28,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=382, PETRI_TRANSITIONS=387} [2025-01-09 21:32:28,565 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -67 predicate places. [2025-01-09 21:32:28,565 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 387 transitions, 794 flow [2025-01-09 21:32:28,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:28,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:28,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:28,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:28,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:28,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash -766234499, now seen corresponding path program 1 times [2025-01-09 21:32:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:28,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330465823] [2025-01-09 21:32:28,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:28,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:32:28,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:32:28,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:28,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:28,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330465823] [2025-01-09 21:32:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330465823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302649421] [2025-01-09 21:32:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:28,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:28,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:28,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-01-09 21:32:28,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 387 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:28,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:28,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-01-09 21:32:28,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:29,319 INFO L124 PetriNetUnfolderBase]: 1292/3799 cut-off events. [2025-01-09 21:32:29,319 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:29,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5579 conditions, 3799 events. 1292/3799 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27563 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5525. Up to 1624 conditions per place. [2025-01-09 21:32:29,354 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-01-09 21:32:29,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 386 transitions, 854 flow [2025-01-09 21:32:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-01-09 21:32:29,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-01-09 21:32:29,359 INFO L175 Difference]: Start difference. First operand has 382 places, 387 transitions, 794 flow. Second operand 3 states and 1268 transitions. [2025-01-09 21:32:29,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 386 transitions, 854 flow [2025-01-09 21:32:29,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 386 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:29,365 INFO L231 Difference]: Finished difference. Result has 381 places, 386 transitions, 792 flow [2025-01-09 21:32:29,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=381, PETRI_TRANSITIONS=386} [2025-01-09 21:32:29,367 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -68 predicate places. [2025-01-09 21:32:29,368 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 386 transitions, 792 flow [2025-01-09 21:32:29,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:29,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:29,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:29,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:29,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:29,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1025072663, now seen corresponding path program 1 times [2025-01-09 21:32:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585963190] [2025-01-09 21:32:29,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:29,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:32:29,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:32:29,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:29,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:29,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:29,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585963190] [2025-01-09 21:32:29,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585963190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:29,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:29,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:29,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949513773] [2025-01-09 21:32:29,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:29,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:29,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:29,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:29,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:29,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-01-09 21:32:29,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 386 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:29,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:29,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-01-09 21:32:29,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:30,118 INFO L124 PetriNetUnfolderBase]: 1292/3798 cut-off events. [2025-01-09 21:32:30,118 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:30,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 3798 events. 1292/3798 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27600 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5516. Up to 1624 conditions per place. [2025-01-09 21:32:30,147 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-01-09 21:32:30,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 385 transitions, 852 flow [2025-01-09 21:32:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-01-09 21:32:30,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-01-09 21:32:30,155 INFO L175 Difference]: Start difference. First operand has 381 places, 386 transitions, 792 flow. Second operand 3 states and 1268 transitions. [2025-01-09 21:32:30,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 385 transitions, 852 flow [2025-01-09 21:32:30,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 385 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:30,162 INFO L231 Difference]: Finished difference. Result has 380 places, 385 transitions, 790 flow [2025-01-09 21:32:30,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=380, PETRI_TRANSITIONS=385} [2025-01-09 21:32:30,164 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -69 predicate places. [2025-01-09 21:32:30,164 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 385 transitions, 790 flow [2025-01-09 21:32:30,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:30,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:30,167 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] [2025-01-09 21:32:30,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:30,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:30,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash 856437038, now seen corresponding path program 1 times [2025-01-09 21:32:30,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:30,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916938215] [2025-01-09 21:32:30,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:30,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:30,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:32:30,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:32:30,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:30,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:30,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916938215] [2025-01-09 21:32:30,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916938215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:30,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:30,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620049085] [2025-01-09 21:32:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:30,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:30,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:30,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:30,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:30,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-01-09 21:32:30,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 385 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:30,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:30,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-01-09 21:32:30,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:30,984 INFO L124 PetriNetUnfolderBase]: 1292/3797 cut-off events. [2025-01-09 21:32:30,984 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:31,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5577 conditions, 3797 events. 1292/3797 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27607 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5507. Up to 1624 conditions per place. [2025-01-09 21:32:31,028 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-01-09 21:32:31,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 384 transitions, 850 flow [2025-01-09 21:32:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-01-09 21:32:31,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-01-09 21:32:31,032 INFO L175 Difference]: Start difference. First operand has 380 places, 385 transitions, 790 flow. Second operand 3 states and 1268 transitions. [2025-01-09 21:32:31,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 384 transitions, 850 flow [2025-01-09 21:32:31,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 384 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:31,041 INFO L231 Difference]: Finished difference. Result has 379 places, 384 transitions, 788 flow [2025-01-09 21:32:31,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=384} [2025-01-09 21:32:31,042 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -70 predicate places. [2025-01-09 21:32:31,042 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 384 transitions, 788 flow [2025-01-09 21:32:31,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:31,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:31,046 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] [2025-01-09 21:32:31,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:31,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:31,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1041907292, now seen corresponding path program 1 times [2025-01-09 21:32:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46691629] [2025-01-09 21:32:31,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:31,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:31,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:32:31,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:32:31,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:31,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46691629] [2025-01-09 21:32:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46691629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:31,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425177834] [2025-01-09 21:32:31,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:31,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:31,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 525 [2025-01-09 21:32:31,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 384 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:31,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 525 [2025-01-09 21:32:31,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:31,738 INFO L124 PetriNetUnfolderBase]: 1292/3796 cut-off events. [2025-01-09 21:32:31,738 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:31,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 3796 events. 1292/3796 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27569 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5504. Up to 1630 conditions per place. [2025-01-09 21:32:31,764 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 35 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-01-09 21:32:31,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 383 transitions, 860 flow [2025-01-09 21:32:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-01-09 21:32:31,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7974603174603174 [2025-01-09 21:32:31,768 INFO L175 Difference]: Start difference. First operand has 379 places, 384 transitions, 788 flow. Second operand 3 states and 1256 transitions. [2025-01-09 21:32:31,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 383 transitions, 860 flow [2025-01-09 21:32:31,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 383 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:31,775 INFO L231 Difference]: Finished difference. Result has 378 places, 383 transitions, 786 flow [2025-01-09 21:32:31,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=383} [2025-01-09 21:32:31,777 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -71 predicate places. [2025-01-09 21:32:31,777 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 383 transitions, 786 flow [2025-01-09 21:32:31,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:31,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:31,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:31,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:31,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:31,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:31,780 INFO L85 PathProgramCache]: Analyzing trace with hash 884521900, now seen corresponding path program 1 times [2025-01-09 21:32:31,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:31,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860370409] [2025-01-09 21:32:31,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:31,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:31,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:32:31,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:32:31,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:31,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:31,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860370409] [2025-01-09 21:32:31,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860370409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819685651] [2025-01-09 21:32:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:31,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:31,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-01-09 21:32:31,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 383 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:31,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-01-09 21:32:31,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:32,340 INFO L124 PetriNetUnfolderBase]: 1292/3795 cut-off events. [2025-01-09 21:32:32,340 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:32,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5576 conditions, 3795 events. 1292/3795 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27552 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5490. Up to 1625 conditions per place. [2025-01-09 21:32:32,378 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-01-09 21:32:32,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 382 transitions, 848 flow [2025-01-09 21:32:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-01-09 21:32:32,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-01-09 21:32:32,382 INFO L175 Difference]: Start difference. First operand has 378 places, 383 transitions, 786 flow. Second operand 3 states and 1266 transitions. [2025-01-09 21:32:32,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 382 transitions, 848 flow [2025-01-09 21:32:32,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:32,388 INFO L231 Difference]: Finished difference. Result has 377 places, 382 transitions, 784 flow [2025-01-09 21:32:32,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=377, PETRI_TRANSITIONS=382} [2025-01-09 21:32:32,390 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -72 predicate places. [2025-01-09 21:32:32,390 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 382 transitions, 784 flow [2025-01-09 21:32:32,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:32,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:32,391 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] [2025-01-09 21:32:32,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:32,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:32,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1427229527, now seen corresponding path program 1 times [2025-01-09 21:32:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356324347] [2025-01-09 21:32:32,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:32,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:32,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:32:32,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:32:32,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:32,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356324347] [2025-01-09 21:32:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356324347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:32,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790018577] [2025-01-09 21:32:32,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:32,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:32,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:32,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:32,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:32,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-01-09 21:32:32,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 382 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:32,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:32,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-01-09 21:32:32,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:32,968 INFO L124 PetriNetUnfolderBase]: 1292/3794 cut-off events. [2025-01-09 21:32:32,968 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:32,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5575 conditions, 3794 events. 1292/3794 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27583 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5481. Up to 1625 conditions per place. [2025-01-09 21:32:32,996 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-01-09 21:32:32,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 381 transitions, 846 flow [2025-01-09 21:32:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-01-09 21:32:33,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-01-09 21:32:33,000 INFO L175 Difference]: Start difference. First operand has 377 places, 382 transitions, 784 flow. Second operand 3 states and 1266 transitions. [2025-01-09 21:32:33,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 381 transitions, 846 flow [2025-01-09 21:32:33,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 381 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:33,006 INFO L231 Difference]: Finished difference. Result has 376 places, 381 transitions, 782 flow [2025-01-09 21:32:33,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=376, PETRI_TRANSITIONS=381} [2025-01-09 21:32:33,008 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -73 predicate places. [2025-01-09 21:32:33,008 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 381 transitions, 782 flow [2025-01-09 21:32:33,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:33,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:33,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:33,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:33,009 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:33,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash 334635798, now seen corresponding path program 1 times [2025-01-09 21:32:33,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296691571] [2025-01-09 21:32:33,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:33,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:32:33,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:32:33,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:33,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:33,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296691571] [2025-01-09 21:32:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296691571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:33,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515360697] [2025-01-09 21:32:33,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:33,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:33,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:33,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:33,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-01-09 21:32:33,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:33,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:33,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-01-09 21:32:33,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:33,625 INFO L124 PetriNetUnfolderBase]: 1292/3793 cut-off events. [2025-01-09 21:32:33,626 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:33,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 3793 events. 1292/3793 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27624 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5472. Up to 1625 conditions per place. [2025-01-09 21:32:33,661 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2025-01-09 21:32:33,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 380 transitions, 844 flow [2025-01-09 21:32:33,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-01-09 21:32:33,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-01-09 21:32:33,664 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 782 flow. Second operand 3 states and 1266 transitions. [2025-01-09 21:32:33,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 380 transitions, 844 flow [2025-01-09 21:32:33,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 380 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:33,671 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 780 flow [2025-01-09 21:32:33,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2025-01-09 21:32:33,674 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -74 predicate places. [2025-01-09 21:32:33,674 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 780 flow [2025-01-09 21:32:33,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:33,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:33,675 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] [2025-01-09 21:32:33,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:33,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:33,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1059687974, now seen corresponding path program 1 times [2025-01-09 21:32:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:33,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191181908] [2025-01-09 21:32:33,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:33,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:33,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:32:33,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:32:33,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:33,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:33,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:33,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191181908] [2025-01-09 21:32:33,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191181908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:33,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:33,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903294277] [2025-01-09 21:32:33,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:33,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:33,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:33,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:33,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:33,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-01-09 21:32:33,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:33,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:33,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-01-09 21:32:33,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:34,257 INFO L124 PetriNetUnfolderBase]: 1292/3792 cut-off events. [2025-01-09 21:32:34,257 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 3792 events. 1292/3792 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27602 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5463. Up to 1625 conditions per place. [2025-01-09 21:32:34,284 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-01-09 21:32:34,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 379 transitions, 842 flow [2025-01-09 21:32:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-01-09 21:32:34,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-01-09 21:32:34,288 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 780 flow. Second operand 3 states and 1266 transitions. [2025-01-09 21:32:34,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 379 transitions, 842 flow [2025-01-09 21:32:34,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:34,294 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 778 flow [2025-01-09 21:32:34,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=374, PETRI_TRANSITIONS=379} [2025-01-09 21:32:34,295 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -75 predicate places. [2025-01-09 21:32:34,295 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 778 flow [2025-01-09 21:32:34,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:34,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:34,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:34,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:34,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash 499152047, now seen corresponding path program 1 times [2025-01-09 21:32:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:34,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559699582] [2025-01-09 21:32:34,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:34,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:32:34,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:32:34,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:34,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:34,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559699582] [2025-01-09 21:32:34,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559699582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:34,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:34,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943711664] [2025-01-09 21:32:34,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:34,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:34,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:34,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:34,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 525 [2025-01-09 21:32:34,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:34,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:34,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 525 [2025-01-09 21:32:34,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:34,751 INFO L124 PetriNetUnfolderBase]: 1377/4049 cut-off events. [2025-01-09 21:32:34,751 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-01-09 21:32:34,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5960 conditions, 4049 events. 1377/4049 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 30117 event pairs, 581 based on Foata normal form. 0/3333 useless extension candidates. Maximal degree in co-relation 5842. Up to 1747 conditions per place. [2025-01-09 21:32:34,777 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 33 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-01-09 21:32:34,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 378 transitions, 846 flow [2025-01-09 21:32:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-01-09 21:32:34,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7961904761904762 [2025-01-09 21:32:34,781 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 778 flow. Second operand 3 states and 1254 transitions. [2025-01-09 21:32:34,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 378 transitions, 846 flow [2025-01-09 21:32:34,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 378 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:34,786 INFO L231 Difference]: Finished difference. Result has 373 places, 378 transitions, 776 flow [2025-01-09 21:32:34,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=373, PETRI_TRANSITIONS=378} [2025-01-09 21:32:34,787 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -76 predicate places. [2025-01-09 21:32:34,787 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 378 transitions, 776 flow [2025-01-09 21:32:34,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:34,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:34,788 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] [2025-01-09 21:32:34,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:34,788 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1393051057, now seen corresponding path program 1 times [2025-01-09 21:32:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953020579] [2025-01-09 21:32:34,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:34,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:32:34,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:32:34,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:34,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:34,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:34,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953020579] [2025-01-09 21:32:34,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953020579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:34,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043573740] [2025-01-09 21:32:34,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:34,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:34,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:34,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 525 [2025-01-09 21:32:34,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 378 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:34,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:34,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 525 [2025-01-09 21:32:34,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:35,503 INFO L124 PetriNetUnfolderBase]: 1479/4329 cut-off events. [2025-01-09 21:32:35,503 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2025-01-09 21:32:35,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 4329 events. 1479/4329 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 32765 event pairs, 643 based on Foata normal form. 0/3573 useless extension candidates. Maximal degree in co-relation 6268. Up to 1891 conditions per place. [2025-01-09 21:32:35,536 INFO L140 encePairwiseOnDemand]: 520/525 looper letters, 34 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2025-01-09 21:32:35,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 374 transitions, 838 flow [2025-01-09 21:32:35,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-01-09 21:32:35,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7866666666666666 [2025-01-09 21:32:35,540 INFO L175 Difference]: Start difference. First operand has 373 places, 378 transitions, 776 flow. Second operand 3 states and 1239 transitions. [2025-01-09 21:32:35,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 374 transitions, 838 flow [2025-01-09 21:32:35,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 374 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:35,546 INFO L231 Difference]: Finished difference. Result has 369 places, 374 transitions, 766 flow [2025-01-09 21:32:35,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=369, PETRI_TRANSITIONS=374} [2025-01-09 21:32:35,547 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -80 predicate places. [2025-01-09 21:32:35,547 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 374 transitions, 766 flow [2025-01-09 21:32:35,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:35,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:35,548 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] [2025-01-09 21:32:35,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:35,549 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:35,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1355384984, now seen corresponding path program 1 times [2025-01-09 21:32:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690555464] [2025-01-09 21:32:35,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:35,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:32:35,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:32:35,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:35,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:36,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690555464] [2025-01-09 21:32:36,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690555464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:36,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:36,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270064292] [2025-01-09 21:32:36,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:36,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:36,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:36,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:36,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 525 [2025-01-09 21:32:36,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 374 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:36,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:36,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 525 [2025-01-09 21:32:36,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:36,965 INFO L124 PetriNetUnfolderBase]: 1292/3779 cut-off events. [2025-01-09 21:32:36,965 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:36,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5566 conditions, 3779 events. 1292/3779 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27484 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5441. Up to 1629 conditions per place. [2025-01-09 21:32:37,000 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 34 selfloop transitions, 5 changer transitions 0/373 dead transitions. [2025-01-09 21:32:37,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 373 transitions, 842 flow [2025-01-09 21:32:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2470 transitions. [2025-01-09 21:32:37,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-01-09 21:32:37,006 INFO L175 Difference]: Start difference. First operand has 369 places, 374 transitions, 766 flow. Second operand 6 states and 2470 transitions. [2025-01-09 21:32:37,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 373 transitions, 842 flow [2025-01-09 21:32:37,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 373 transitions, 841 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:37,011 INFO L231 Difference]: Finished difference. Result has 372 places, 373 transitions, 773 flow [2025-01-09 21:32:37,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=773, PETRI_PLACES=372, PETRI_TRANSITIONS=373} [2025-01-09 21:32:37,013 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -77 predicate places. [2025-01-09 21:32:37,013 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 373 transitions, 773 flow [2025-01-09 21:32:37,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:37,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:37,015 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] [2025-01-09 21:32:37,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:37,015 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:37,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash -454445634, now seen corresponding path program 1 times [2025-01-09 21:32:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863088534] [2025-01-09 21:32:37,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:37,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:32:37,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:32:37,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:37,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863088534] [2025-01-09 21:32:37,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863088534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:37,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:37,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:37,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281627420] [2025-01-09 21:32:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:37,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:37,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:37,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:37,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:37,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-01-09 21:32:37,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 373 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:37,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:37,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-01-09 21:32:37,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:37,587 INFO L124 PetriNetUnfolderBase]: 1292/3778 cut-off events. [2025-01-09 21:32:37,587 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-09 21:32:37,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5562 conditions, 3778 events. 1292/3778 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 27543 event pairs, 536 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 5544. Up to 1624 conditions per place. [2025-01-09 21:32:37,619 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-01-09 21:32:37,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 372 transitions, 833 flow [2025-01-09 21:32:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-01-09 21:32:37,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-01-09 21:32:37,623 INFO L175 Difference]: Start difference. First operand has 372 places, 373 transitions, 773 flow. Second operand 3 states and 1268 transitions. [2025-01-09 21:32:37,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 372 transitions, 833 flow [2025-01-09 21:32:37,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 372 transitions, 823 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:37,627 INFO L231 Difference]: Finished difference. Result has 368 places, 372 transitions, 765 flow [2025-01-09 21:32:37,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=368, PETRI_TRANSITIONS=372} [2025-01-09 21:32:37,628 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -81 predicate places. [2025-01-09 21:32:37,629 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 372 transitions, 765 flow [2025-01-09 21:32:37,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:37,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:37,630 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] [2025-01-09 21:32:37,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:32:37,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:37,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1280189220, now seen corresponding path program 1 times [2025-01-09 21:32:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121511633] [2025-01-09 21:32:37,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:37,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:32:37,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:32:37,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:37,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:37,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:37,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121511633] [2025-01-09 21:32:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121511633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:37,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:37,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325723978] [2025-01-09 21:32:37,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:37,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:37,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:37,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:37,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 525 [2025-01-09 21:32:37,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 372 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:37,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:37,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 525 [2025-01-09 21:32:37,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:38,416 INFO L124 PetriNetUnfolderBase]: 1814/4923 cut-off events. [2025-01-09 21:32:38,417 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2025-01-09 21:32:38,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7448 conditions, 4923 events. 1814/4923 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 38030 event pairs, 408 based on Foata normal form. 0/4108 useless extension candidates. Maximal degree in co-relation 7322. Up to 1170 conditions per place. [2025-01-09 21:32:38,467 INFO L140 encePairwiseOnDemand]: 516/525 looper letters, 58 selfloop transitions, 3 changer transitions 0/388 dead transitions. [2025-01-09 21:32:38,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 388 transitions, 931 flow [2025-01-09 21:32:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2025-01-09 21:32:38,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8044444444444444 [2025-01-09 21:32:38,471 INFO L175 Difference]: Start difference. First operand has 368 places, 372 transitions, 765 flow. Second operand 3 states and 1267 transitions. [2025-01-09 21:32:38,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 388 transitions, 931 flow [2025-01-09 21:32:38,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 388 transitions, 927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:38,481 INFO L231 Difference]: Finished difference. Result has 364 places, 368 transitions, 769 flow [2025-01-09 21:32:38,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=364, PETRI_TRANSITIONS=368} [2025-01-09 21:32:38,483 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -85 predicate places. [2025-01-09 21:32:38,483 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 368 transitions, 769 flow [2025-01-09 21:32:38,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:38,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:38,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:38,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:32:38,484 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:38,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:38,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1901252078, now seen corresponding path program 1 times [2025-01-09 21:32:38,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:38,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237207592] [2025-01-09 21:32:38,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:38,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:32:38,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:32:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:38,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:38,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:38,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237207592] [2025-01-09 21:32:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237207592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:38,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:38,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460740839] [2025-01-09 21:32:38,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:38,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:38,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:38,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:38,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-01-09 21:32:38,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 368 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:38,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:38,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-01-09 21:32:38,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:39,442 INFO L124 PetriNetUnfolderBase]: 2365/6539 cut-off events. [2025-01-09 21:32:39,443 INFO L125 PetriNetUnfolderBase]: For 988/988 co-relation queries the response was YES. [2025-01-09 21:32:39,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10206 conditions, 6539 events. 2365/6539 cut-off events. For 988/988 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 55367 event pairs, 629 based on Foata normal form. 0/5506 useless extension candidates. Maximal degree in co-relation 10079. Up to 1646 conditions per place. [2025-01-09 21:32:39,503 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 50 selfloop transitions, 4 changer transitions 0/390 dead transitions. [2025-01-09 21:32:39,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 390 transitions, 944 flow [2025-01-09 21:32:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2025-01-09 21:32:39,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8228571428571428 [2025-01-09 21:32:39,507 INFO L175 Difference]: Start difference. First operand has 364 places, 368 transitions, 769 flow. Second operand 3 states and 1296 transitions. [2025-01-09 21:32:39,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 390 transitions, 944 flow [2025-01-09 21:32:39,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 390 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:39,514 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 793 flow [2025-01-09 21:32:39,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2025-01-09 21:32:39,515 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -84 predicate places. [2025-01-09 21:32:39,515 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 793 flow [2025-01-09 21:32:39,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:39,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:39,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:39,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:32:39,516 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:39,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash 928575953, now seen corresponding path program 1 times [2025-01-09 21:32:39,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:39,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261563498] [2025-01-09 21:32:39,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:32:39,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:32:39,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:39,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261563498] [2025-01-09 21:32:39,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261563498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:39,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:39,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533822678] [2025-01-09 21:32:39,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:39,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:39,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:39,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:39,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 525 [2025-01-09 21:32:39,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:39,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:39,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 525 [2025-01-09 21:32:39,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:40,945 INFO L124 PetriNetUnfolderBase]: 4048/11063 cut-off events. [2025-01-09 21:32:40,946 INFO L125 PetriNetUnfolderBase]: For 2294/2294 co-relation queries the response was YES. [2025-01-09 21:32:40,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17945 conditions, 11063 events. 4048/11063 cut-off events. For 2294/2294 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 105617 event pairs, 1964 based on Foata normal form. 0/9260 useless extension candidates. Maximal degree in co-relation 17818. Up to 3035 conditions per place. [2025-01-09 21:32:41,019 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 60 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2025-01-09 21:32:41,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 399 transitions, 1022 flow [2025-01-09 21:32:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-01-09 21:32:41,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2025-01-09 21:32:41,022 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 793 flow. Second operand 3 states and 1302 transitions. [2025-01-09 21:32:41,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 399 transitions, 1022 flow [2025-01-09 21:32:41,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 399 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:41,030 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 803 flow [2025-01-09 21:32:41,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2025-01-09 21:32:41,031 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -83 predicate places. [2025-01-09 21:32:41,031 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 803 flow [2025-01-09 21:32:41,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:41,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:41,032 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] [2025-01-09 21:32:41,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:32:41,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1170540717, now seen corresponding path program 1 times [2025-01-09 21:32:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:41,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131137299] [2025-01-09 21:32:41,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:41,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 21:32:41,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 21:32:41,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:41,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131137299] [2025-01-09 21:32:41,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131137299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:41,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:41,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:41,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133440729] [2025-01-09 21:32:41,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:41,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:41,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:41,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:41,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-01-09 21:32:41,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:41,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:41,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-01-09 21:32:41,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:43,461 INFO L124 PetriNetUnfolderBase]: 7061/18755 cut-off events. [2025-01-09 21:32:43,462 INFO L125 PetriNetUnfolderBase]: For 3913/3913 co-relation queries the response was YES. [2025-01-09 21:32:43,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31375 conditions, 18755 events. 7061/18755 cut-off events. For 3913/3913 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 195444 event pairs, 3451 based on Foata normal form. 0/15759 useless extension candidates. Maximal degree in co-relation 31246. Up to 5267 conditions per place. [2025-01-09 21:32:43,595 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 64 selfloop transitions, 4 changer transitions 0/402 dead transitions. [2025-01-09 21:32:43,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 402 transitions, 1052 flow [2025-01-09 21:32:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-01-09 21:32:43,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2025-01-09 21:32:43,597 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 803 flow. Second operand 3 states and 1300 transitions. [2025-01-09 21:32:43,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 402 transitions, 1052 flow [2025-01-09 21:32:43,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 402 transitions, 1042 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:43,607 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 827 flow [2025-01-09 21:32:43,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2025-01-09 21:32:43,608 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -82 predicate places. [2025-01-09 21:32:43,608 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 827 flow [2025-01-09 21:32:43,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:43,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:43,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:32:43,611 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash -463954134, now seen corresponding path program 1 times [2025-01-09 21:32:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567488158] [2025-01-09 21:32:43,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 21:32:43,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 21:32:43,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:43,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567488158] [2025-01-09 21:32:43,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567488158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224367825] [2025-01-09 21:32:43,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-01-09 21:32:43,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-01-09 21:32:43,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,387 INFO L124 PetriNetUnfolderBase]: 9127/21789 cut-off events. [2025-01-09 21:32:46,387 INFO L125 PetriNetUnfolderBase]: For 5562/5562 co-relation queries the response was YES. [2025-01-09 21:32:46,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38802 conditions, 21789 events. 9127/21789 cut-off events. For 5562/5562 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 218884 event pairs, 1204 based on Foata normal form. 0/18743 useless extension candidates. Maximal degree in co-relation 38672. Up to 10921 conditions per place. [2025-01-09 21:32:46,535 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 64 selfloop transitions, 4 changer transitions 0/398 dead transitions. [2025-01-09 21:32:46,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 398 transitions, 1057 flow [2025-01-09 21:32:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-01-09 21:32:46,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.813968253968254 [2025-01-09 21:32:46,538 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 827 flow. Second operand 3 states and 1282 transitions. [2025-01-09 21:32:46,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 398 transitions, 1057 flow [2025-01-09 21:32:46,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 398 transitions, 1043 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:46,551 INFO L231 Difference]: Finished difference. Result has 366 places, 374 transitions, 839 flow [2025-01-09 21:32:46,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=366, PETRI_TRANSITIONS=374} [2025-01-09 21:32:46,552 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -83 predicate places. [2025-01-09 21:32:46,552 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 374 transitions, 839 flow [2025-01-09 21:32:46,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,553 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] [2025-01-09 21:32:46,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:32:46,553 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2141560466, now seen corresponding path program 1 times [2025-01-09 21:32:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856475993] [2025-01-09 21:32:46,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:32:46,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:32:46,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856475993] [2025-01-09 21:32:46,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856475993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082730363] [2025-01-09 21:32:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-01-09 21:32:46,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 374 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-01-09 21:32:46,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:50,880 INFO L124 PetriNetUnfolderBase]: 11737/30511 cut-off events. [2025-01-09 21:32:50,880 INFO L125 PetriNetUnfolderBase]: For 7741/7741 co-relation queries the response was YES. [2025-01-09 21:32:50,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54534 conditions, 30511 events. 11737/30511 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 334977 event pairs, 2352 based on Foata normal form. 0/26196 useless extension candidates. Maximal degree in co-relation 54404. Up to 12037 conditions per place. [2025-01-09 21:32:51,106 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 69 selfloop transitions, 4 changer transitions 0/402 dead transitions. [2025-01-09 21:32:51,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 402 transitions, 1090 flow [2025-01-09 21:32:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-01-09 21:32:51,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8146031746031746 [2025-01-09 21:32:51,109 INFO L175 Difference]: Start difference. First operand has 366 places, 374 transitions, 839 flow. Second operand 3 states and 1283 transitions. [2025-01-09 21:32:51,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 402 transitions, 1090 flow [2025-01-09 21:32:51,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 402 transitions, 1090 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:32:51,119 INFO L231 Difference]: Finished difference. Result has 367 places, 375 transitions, 859 flow [2025-01-09 21:32:51,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=367, PETRI_TRANSITIONS=375} [2025-01-09 21:32:51,120 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -82 predicate places. [2025-01-09 21:32:51,120 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 375 transitions, 859 flow [2025-01-09 21:32:51,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:51,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:51,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:51,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:32:51,121 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:51,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:51,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1178033219, now seen corresponding path program 1 times [2025-01-09 21:32:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:51,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208218486] [2025-01-09 21:32:51,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:51,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:51,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 21:32:51,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 21:32:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208218486] [2025-01-09 21:32:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208218486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:51,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:51,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:51,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887157683] [2025-01-09 21:32:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:51,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:51,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:51,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:51,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:51,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-01-09 21:32:51,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 375 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:51,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:51,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-01-09 21:32:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:55,347 INFO L124 PetriNetUnfolderBase]: 10925/29786 cut-off events. [2025-01-09 21:32:55,347 INFO L125 PetriNetUnfolderBase]: For 9466/9466 co-relation queries the response was YES. [2025-01-09 21:32:55,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55191 conditions, 29786 events. 10925/29786 cut-off events. For 9466/9466 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 335337 event pairs, 4510 based on Foata normal form. 0/25474 useless extension candidates. Maximal degree in co-relation 55060. Up to 14071 conditions per place. [2025-01-09 21:32:55,585 INFO L140 encePairwiseOnDemand]: 523/525 looper letters, 42 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2025-01-09 21:32:55,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 374 transitions, 943 flow [2025-01-09 21:32:55,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-01-09 21:32:55,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2025-01-09 21:32:55,587 INFO L175 Difference]: Start difference. First operand has 367 places, 375 transitions, 859 flow. Second operand 3 states and 1275 transitions. [2025-01-09 21:32:55,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 374 transitions, 943 flow [2025-01-09 21:32:55,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 943 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:32:55,600 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 859 flow [2025-01-09 21:32:55,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2025-01-09 21:32:55,601 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -81 predicate places. [2025-01-09 21:32:55,601 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 859 flow [2025-01-09 21:32:55,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:55,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:55,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:55,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:32:55,602 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-01-09 21:32:55,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:55,603 INFO L85 PathProgramCache]: Analyzing trace with hash 993553045, now seen corresponding path program 1 times [2025-01-09 21:32:55,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:55,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320222663] [2025-01-09 21:32:55,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:55,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 21:32:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 21:32:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320222663] [2025-01-09 21:32:55,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320222663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:55,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:55,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125127167] [2025-01-09 21:32:55,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:55,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:55,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:55,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:55,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-01-09 21:32:55,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:55,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:55,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-01-09 21:32:55,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:59,975 INFO L124 PetriNetUnfolderBase]: 10925/29785 cut-off events. [2025-01-09 21:32:59,976 INFO L125 PetriNetUnfolderBase]: For 9466/9466 co-relation queries the response was YES. [2025-01-09 21:33:00,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55191 conditions, 29785 events. 10925/29785 cut-off events. For 9466/9466 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 335472 event pairs, 4510 based on Foata normal form. 1/25474 useless extension candidates. Maximal degree in co-relation 55177. Up to 14071 conditions per place. [2025-01-09 21:33:00,123 INFO L140 encePairwiseOnDemand]: 523/525 looper letters, 0 selfloop transitions, 0 changer transitions 373/373 dead transitions. [2025-01-09 21:33:00,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 941 flow [2025-01-09 21:33:00,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1274 transitions. [2025-01-09 21:33:00,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088888888888889 [2025-01-09 21:33:00,125 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 859 flow. Second operand 3 states and 1274 transitions. [2025-01-09 21:33:00,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 941 flow [2025-01-09 21:33:00,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 373 transitions, 940 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:00,136 INFO L231 Difference]: Finished difference. Result has 368 places, 0 transitions, 0 flow [2025-01-09 21:33:00,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=368, PETRI_TRANSITIONS=0} [2025-01-09 21:33:00,137 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -81 predicate places. [2025-01-09 21:33:00,137 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 0 transitions, 0 flow [2025-01-09 21:33:00,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:00,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (146 of 147 remaining) [2025-01-09 21:33:00,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (145 of 147 remaining) [2025-01-09 21:33:00,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (144 of 147 remaining) [2025-01-09 21:33:00,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (143 of 147 remaining) [2025-01-09 21:33:00,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (142 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (141 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (140 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (139 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (138 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (137 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (136 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (135 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (133 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (132 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (131 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (130 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (129 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (128 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (127 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (126 of 147 remaining) [2025-01-09 21:33:00,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (125 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (124 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (123 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (122 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (121 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (120 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (119 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (118 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (117 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (116 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (115 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (114 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (113 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (112 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (111 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (110 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (109 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (108 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (107 of 147 remaining) [2025-01-09 21:33:00,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (106 of 147 remaining) [2025-01-09 21:33:00,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (105 of 147 remaining) [2025-01-09 21:33:00,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 147 remaining) [2025-01-09 21:33:00,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 147 remaining) [2025-01-09 21:33:00,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (102 of 147 remaining) [2025-01-09 21:33:00,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (101 of 147 remaining) [2025-01-09 21:33:00,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (100 of 147 remaining) [2025-01-09 21:33:00,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (99 of 147 remaining) [2025-01-09 21:33:00,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (98 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (97 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (96 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (95 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (94 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (93 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (92 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (91 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (90 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (89 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 147 remaining) [2025-01-09 21:33:00,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (86 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (85 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (84 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (83 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (82 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (79 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (78 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (77 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (76 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (75 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (74 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (73 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (72 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (71 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (70 of 147 remaining) [2025-01-09 21:33:00,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (69 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (68 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (67 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (66 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (65 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (64 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (63 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (62 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (61 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (60 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (59 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (58 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (50 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (49 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (47 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (46 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (44 of 147 remaining) [2025-01-09 21:33:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (42 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (41 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (40 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 147 remaining) [2025-01-09 21:33:00,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 147 remaining) [2025-01-09 21:33:00,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 147 remaining) [2025-01-09 21:33:00,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (28 of 147 remaining) [2025-01-09 21:33:00,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (27 of 147 remaining) [2025-01-09 21:33:00,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (26 of 147 remaining) [2025-01-09 21:33:00,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (25 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (24 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (21 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (20 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (19 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (18 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (17 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (16 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (15 of 147 remaining) [2025-01-09 21:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (14 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (13 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (12 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (11 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (10 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (9 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (8 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (7 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (6 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (4 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (3 of 147 remaining) [2025-01-09 21:33:00,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (2 of 147 remaining) [2025-01-09 21:33:00,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (1 of 147 remaining) [2025-01-09 21:33:00,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (0 of 147 remaining) [2025-01-09 21:33:00,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:33:00,151 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:00,160 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:00,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:00,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:00 BasicIcfg [2025-01-09 21:33:00,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:00,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:00,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:00,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:00,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:24" (3/4) ... [2025-01-09 21:33:00,169 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:00,172 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:00,172 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:00,172 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:00,172 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:33:00,172 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-01-09 21:33:00,172 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-01-09 21:33:00,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-01-09 21:33:00,180 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:00,180 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:00,181 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:00,271 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:00,271 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:00,271 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:00,272 INFO L158 Benchmark]: Toolchain (without parser) took 37709.63ms. Allocated memory was 142.6MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 112.8MB in the beginning and 6.4GB in the end (delta: -6.2GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-01-09 21:33:00,273 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:00,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.76ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 98.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:00,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.28ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:00,275 INFO L158 Benchmark]: Boogie Preprocessor took 77.79ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:00,276 INFO L158 Benchmark]: RCFGBuilder took 1625.33ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 86.5MB in the end (delta: 4.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:00,276 INFO L158 Benchmark]: TraceAbstraction took 35475.81ms. Allocated memory was 142.6MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 85.7MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2025-01-09 21:33:00,277 INFO L158 Benchmark]: Witness Printer took 104.35ms. Allocated memory is still 8.1GB. Free memory was 6.4GB in the beginning and 6.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:00,278 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.76ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 98.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.28ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.79ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1625.33ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 86.5MB in the end (delta: 4.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * TraceAbstraction took 35475.81ms. Allocated memory was 142.6MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 85.7MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 104.35ms. Allocated memory is still 8.1GB. Free memory was 6.4GB in the beginning and 6.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 625 locations, 147 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1682 IncrementalHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 114 mSDtfsCounter, 1682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2944 NumberOfCodeBlocks, 2944 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2921 ConstructedInterpolants, 0 QuantifiedInterpolants, 3080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 83 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:00,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE