./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult.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 e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:16,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:17,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:40:17,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:17,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:17,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:17,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:17,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:17,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:17,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:17,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:17,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:17,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:17,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:17,089 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:17,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:17,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:17,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:17,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:17,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:17,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:17,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:17,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:17,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:17,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:17,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:17,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:17,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:17,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:17,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:17,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:17,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:17,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:17,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:17,091 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 -> e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe [2025-02-08 05:40:17,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:17,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:17,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:17,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:17,399 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:17,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2025-02-08 05:40:18,755 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d6006bc9/26da745fe7224bf5b2d8a44aad8a5e2e/FLAGa7cd53df7 [2025-02-08 05:40:19,048 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:19,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2025-02-08 05:40:19,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d6006bc9/26da745fe7224bf5b2d8a44aad8a5e2e/FLAGa7cd53df7 [2025-02-08 05:40:19,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d6006bc9/26da745fe7224bf5b2d8a44aad8a5e2e [2025-02-08 05:40:19,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:19,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:19,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:19,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:19,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:19,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5373cd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19, skipping insertion in model container [2025-02-08 05:40:19,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:19,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:19,327 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:19,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:19,398 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:19,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19 WrapperNode [2025-02-08 05:40:19,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:19,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:19,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:19,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:19,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,459 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 560 [2025-02-08 05:40:19,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:19,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:19,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:19,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:19,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:19,505 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:19,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:19,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:19,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:19,544 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-02-08 05:40:19,546 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-02-08 05:40:19,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:19,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:19,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:19,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:19,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:40:19,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:40:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:19,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:19,571 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:40:19,691 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:19,693 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:20,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc #t~nondet18#1; [2025-02-08 05:40:20,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-1: havoc #t~ret17#1; [2025-02-08 05:40:20,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-2: assume #race~total~0 == #t~nondet18#1; [2025-02-08 05:40:20,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-2: assume !(#race~total~0 == #t~nondet18#1); [2025-02-08 05:40:20,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-3: havoc #t~mem16#1; [2025-02-08 05:40:20,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-4: #race~total~0 := #t~nondet18#1; [2025-02-08 05:40:20,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-5: havoc #t~nondet18#1; [2025-02-08 05:40:20,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-6: ~total~0 := #t~ret17#1; [2025-02-08 05:40:20,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 05:40:20,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-10: #t~ret17#1 := plus_#res#1; [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc #t~nondet20#1; [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-1: assume #race~q1_front~0 == #t~nondet20#1; [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-1: assume !(#race~q1_front~0 == #t~nondet20#1); [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-2: havoc #t~post19#1; [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-3: #race~q1_front~0 := #t~nondet20#1; [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-4: havoc #t~nondet20#1; [2025-02-08 05:40:20,193 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-5: ~q1_front~0 := 1 + #t~post19#1; [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-6: assume 0 == #race~q1_front~0; [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-6: assume !(0 == #race~q1_front~0); [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-7: #t~post19#1 := ~q1_front~0; [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97-8: #race~q1_front~0 := 0; [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: #race~i~0 := 0; [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc #t~short21#1; [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-1: ~cond~2#1 := (if 0 == (if #t~short21#1 then 1 else 0) then 0 else 1); [2025-02-08 05:40:20,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-2: assume 0 == #race~q1_back~0; [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-2: assume !(0 == #race~q1_back~0); [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-3: #t~short21#1 := ~q1_front~0 < ~q1_back~0; [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-4: assume 0 == #race~q1_front~0; [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-4: assume !(0 == #race~q1_front~0); [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-5: #race~q1_back~0 := 0; [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-6: assume #t~short21#1; [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-6: assume !#t~short21#1; [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-7: #race~q1_front~0 := 0; [2025-02-08 05:40:20,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-8: assume 0 == #race~N~0; [2025-02-08 05:40:20,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-8: assume !(0 == #race~N~0); [2025-02-08 05:40:20,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-9: #t~short21#1 := ~i~0 < ~N~0; [2025-02-08 05:40:20,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-10: assume 0 == #race~i~0; [2025-02-08 05:40:20,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-10: assume !(0 == #race~i~0); [2025-02-08 05:40:20,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-11: #race~N~0 := 0; [2025-02-08 05:40:20,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: [2025-02-08 05:40:20,551 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc #t~short30#1; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-1: ~cond~3#1 := (if 0 == (if #t~short30#1 then 1 else 0) then 0 else 1); [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-2: assume 0 == #race~q2_back~0; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-2: assume !(0 == #race~q2_back~0); [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-3: #t~short30#1 := ~q2_front~0 < ~q2_back~0; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-4: assume 0 == #race~q2_front~0; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-4: assume !(0 == #race~q2_front~0); [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-5: #race~q2_back~0 := 0; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-6: assume #t~short30#1; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-6: assume !#t~short30#1; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-7: #race~q2_front~0 := 0; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-8: assume 0 == #race~N~0; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-8: assume !(0 == #race~N~0); [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-9: #t~short30#1 := ~j~0 < ~N~0; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-10: assume 0 == #race~j~0; [2025-02-08 05:40:20,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-10: assume !(0 == #race~j~0); [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-11: #race~N~0 := 0; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc #t~nondet27#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: havoc #t~ret26#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: assume #race~total~0 == #t~nondet27#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: assume !(#race~total~0 == #t~nondet27#1); [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: havoc #t~mem25#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-4: #race~total~0 := #t~nondet27#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-5: havoc #t~nondet27#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-6: ~total~0 := #t~ret26#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-10: #t~ret26#1 := plus_#res#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc #t~nondet29#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: assume #race~q2_front~0 == #t~nondet29#1; [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: assume !(#race~q2_front~0 == #t~nondet29#1); [2025-02-08 05:40:20,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-2: havoc #t~post28#1; [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-3: #race~q2_front~0 := #t~nondet29#1; [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-4: havoc #t~nondet29#1; [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-5: ~q2_front~0 := 1 + #t~post28#1; [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-6: assume 0 == #race~q2_front~0; [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-6: assume !(0 == #race~q2_front~0); [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-7: #t~post28#1 := ~q2_front~0; [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-8: #race~q2_front~0 := 0; [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: [2025-02-08 05:40:20,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: #race~j~0 := 0; [2025-02-08 05:40:20,556 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:20,556 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:20,943 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L171 is not an error location. [2025-02-08 05:40:20,944 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L171 is not an error location. [2025-02-08 05:40:20,944 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:20,944 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:20,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:20 BoogieIcfgContainer [2025-02-08 05:40:20,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:20,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:20,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:20,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:20,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:19" (1/3) ... [2025-02-08 05:40:20,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db3c165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:20, skipping insertion in model container [2025-02-08 05:40:20,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (2/3) ... [2025-02-08 05:40:20,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db3c165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:20, skipping insertion in model container [2025-02-08 05:40:20,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:20" (3/3) ... [2025-02-08 05:40:20,953 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2025-02-08 05:40:20,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:20,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 357 locations, 1 initial locations, 6 loop locations, and 89 error locations. [2025-02-08 05:40:20,969 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:21,096 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:40:21,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 367 transitions, 762 flow [2025-02-08 05:40:21,284 INFO L124 PetriNetUnfolderBase]: 11/363 cut-off events. [2025-02-08 05:40:21,286 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:21,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 363 events. 11/363 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 502 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 323. Up to 2 conditions per place. [2025-02-08 05:40:21,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 367 transitions, 762 flow [2025-02-08 05:40:21,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 349 places, 346 transitions, 716 flow [2025-02-08 05:40:21,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:21,324 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;@666d096e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:21,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2025-02-08 05:40:21,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:21,330 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-08 05:40:21,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:21,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:21,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:21,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 187902092, now seen corresponding path program 1 times [2025-02-08 05:40:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069031479] [2025-02-08 05:40:21,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:40:21,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:40:21,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:21,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069031479] [2025-02-08 05:40:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069031479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262085421] [2025-02-08 05:40:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 367 [2025-02-08 05:40:21,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 346 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:21,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 367 [2025-02-08 05:40:21,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:22,104 INFO L124 PetriNetUnfolderBase]: 602/1520 cut-off events. [2025-02-08 05:40:22,104 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-02-08 05:40:22,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 1520 events. 602/1520 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8628 event pairs, 485 based on Foata normal form. 5/1368 useless extension candidates. Maximal degree in co-relation 2224. Up to 865 conditions per place. [2025-02-08 05:40:22,115 INFO L140 encePairwiseOnDemand]: 303/367 looper letters, 22 selfloop transitions, 2 changer transitions 7/284 dead transitions. [2025-02-08 05:40:22,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 284 transitions, 644 flow [2025-02-08 05:40:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-02-08 05:40:22,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8319709355131698 [2025-02-08 05:40:22,141 INFO L175 Difference]: Start difference. First operand has 349 places, 346 transitions, 716 flow. Second operand 3 states and 916 transitions. [2025-02-08 05:40:22,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 284 transitions, 644 flow [2025-02-08 05:40:22,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 284 transitions, 628 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:40:22,154 INFO L231 Difference]: Finished difference. Result has 286 places, 277 transitions, 566 flow [2025-02-08 05:40:22,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=286, PETRI_TRANSITIONS=277} [2025-02-08 05:40:22,160 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -63 predicate places. [2025-02-08 05:40:22,161 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 277 transitions, 566 flow [2025-02-08 05:40:22,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:22,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:22,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:22,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash -25197338, now seen corresponding path program 1 times [2025-02-08 05:40:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906840164] [2025-02-08 05:40:22,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:40:22,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:40:22,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906840164] [2025-02-08 05:40:22,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906840164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:22,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:22,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:22,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542762001] [2025-02-08 05:40:22,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:22,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:22,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:22,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:22,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 367 [2025-02-08 05:40:22,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 277 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 367 [2025-02-08 05:40:22,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:22,480 INFO L124 PetriNetUnfolderBase]: 285/947 cut-off events. [2025-02-08 05:40:22,480 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:22,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 947 events. 285/947 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4525 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1393. Up to 426 conditions per place. [2025-02-08 05:40:22,487 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 22 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-02-08 05:40:22,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 276 transitions, 612 flow [2025-02-08 05:40:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:22,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7747502270663034 [2025-02-08 05:40:22,490 INFO L175 Difference]: Start difference. First operand has 286 places, 277 transitions, 566 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:22,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 276 transitions, 612 flow [2025-02-08 05:40:22,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 276 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:22,496 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 564 flow [2025-02-08 05:40:22,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2025-02-08 05:40:22,497 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -71 predicate places. [2025-02-08 05:40:22,498 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 564 flow [2025-02-08 05:40:22,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:22,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:22,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1474572151, now seen corresponding path program 1 times [2025-02-08 05:40:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850805730] [2025-02-08 05:40:22,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:40:22,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:40:22,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:22,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:22,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850805730] [2025-02-08 05:40:22,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850805730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:22,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:22,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:22,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869908028] [2025-02-08 05:40:22,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:22,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:22,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:22,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:22,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:22,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 367 [2025-02-08 05:40:22,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 367 [2025-02-08 05:40:22,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:22,781 INFO L124 PetriNetUnfolderBase]: 285/946 cut-off events. [2025-02-08 05:40:22,782 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:22,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 946 events. 285/946 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4544 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1384. Up to 426 conditions per place. [2025-02-08 05:40:22,788 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 22 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-02-08 05:40:22,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 275 transitions, 610 flow [2025-02-08 05:40:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:22,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7747502270663034 [2025-02-08 05:40:22,791 INFO L175 Difference]: Start difference. First operand has 278 places, 276 transitions, 564 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:22,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 275 transitions, 610 flow [2025-02-08 05:40:22,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 275 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:22,797 INFO L231 Difference]: Finished difference. Result has 277 places, 275 transitions, 562 flow [2025-02-08 05:40:22,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=277, PETRI_TRANSITIONS=275} [2025-02-08 05:40:22,799 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -72 predicate places. [2025-02-08 05:40:22,799 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 275 transitions, 562 flow [2025-02-08 05:40:22,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:22,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:22,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:22,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -572265780, now seen corresponding path program 1 times [2025-02-08 05:40:22,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845294585] [2025-02-08 05:40:22,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:40:22,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:40:22,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:22,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845294585] [2025-02-08 05:40:22,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845294585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:22,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:22,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562708782] [2025-02-08 05:40:22,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:22,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:22,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:22,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:22,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 367 [2025-02-08 05:40:22,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 275 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 367 [2025-02-08 05:40:22,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,082 INFO L124 PetriNetUnfolderBase]: 285/945 cut-off events. [2025-02-08 05:40:23,082 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:23,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 945 events. 285/945 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4530 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1375. Up to 426 conditions per place. [2025-02-08 05:40:23,089 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 22 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-02-08 05:40:23,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 274 transitions, 608 flow [2025-02-08 05:40:23,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:23,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7747502270663034 [2025-02-08 05:40:23,092 INFO L175 Difference]: Start difference. First operand has 277 places, 275 transitions, 562 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:23,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 274 transitions, 608 flow [2025-02-08 05:40:23,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 274 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:23,097 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 560 flow [2025-02-08 05:40:23,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2025-02-08 05:40:23,099 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -73 predicate places. [2025-02-08 05:40:23,099 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 560 flow [2025-02-08 05:40:23,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,100 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] [2025-02-08 05:40:23,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:23,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 587710529, now seen corresponding path program 1 times [2025-02-08 05:40:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173484545] [2025-02-08 05:40:23,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:40:23,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:40:23,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173484545] [2025-02-08 05:40:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173484545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597266747] [2025-02-08 05:40:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 367 [2025-02-08 05:40:23,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 274 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 367 [2025-02-08 05:40:23,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,404 INFO L124 PetriNetUnfolderBase]: 285/944 cut-off events. [2025-02-08 05:40:23,404 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:23,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 944 events. 285/944 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4558 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1366. Up to 426 conditions per place. [2025-02-08 05:40:23,412 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 22 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-02-08 05:40:23,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 273 transitions, 606 flow [2025-02-08 05:40:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:23,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7747502270663034 [2025-02-08 05:40:23,415 INFO L175 Difference]: Start difference. First operand has 276 places, 274 transitions, 560 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:23,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 273 transitions, 606 flow [2025-02-08 05:40:23,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 273 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:23,419 INFO L231 Difference]: Finished difference. Result has 275 places, 273 transitions, 558 flow [2025-02-08 05:40:23,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=275, PETRI_TRANSITIONS=273} [2025-02-08 05:40:23,420 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -74 predicate places. [2025-02-08 05:40:23,420 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 273 transitions, 558 flow [2025-02-08 05:40:23,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,421 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] [2025-02-08 05:40:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:23,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -554178262, now seen corresponding path program 1 times [2025-02-08 05:40:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359443526] [2025-02-08 05:40:23,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:40:23,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:40:23,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359443526] [2025-02-08 05:40:23,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359443526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833066645] [2025-02-08 05:40:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 367 [2025-02-08 05:40:23,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 367 [2025-02-08 05:40:23,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,641 INFO L124 PetriNetUnfolderBase]: 285/943 cut-off events. [2025-02-08 05:40:23,642 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:40:23,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 943 events. 285/943 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4551 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1354. Up to 423 conditions per place. [2025-02-08 05:40:23,649 INFO L140 encePairwiseOnDemand]: 365/367 looper letters, 20 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2025-02-08 05:40:23,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 272 transitions, 598 flow [2025-02-08 05:40:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-02-08 05:40:23,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829246139872843 [2025-02-08 05:40:23,652 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 558 flow. Second operand 3 states and 862 transitions. [2025-02-08 05:40:23,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 272 transitions, 598 flow [2025-02-08 05:40:23,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:23,657 INFO L231 Difference]: Finished difference. Result has 274 places, 272 transitions, 554 flow [2025-02-08 05:40:23,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=274, PETRI_TRANSITIONS=272} [2025-02-08 05:40:23,658 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -75 predicate places. [2025-02-08 05:40:23,658 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 272 transitions, 554 flow [2025-02-08 05:40:23,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,659 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] [2025-02-08 05:40:23,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:23,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:23,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1668357477, now seen corresponding path program 1 times [2025-02-08 05:40:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467921867] [2025-02-08 05:40:23,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:40:23,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:40:23,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467921867] [2025-02-08 05:40:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467921867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096995570] [2025-02-08 05:40:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 367 [2025-02-08 05:40:23,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 367 [2025-02-08 05:40:23,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,852 INFO L124 PetriNetUnfolderBase]: 285/942 cut-off events. [2025-02-08 05:40:23,853 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:23,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 942 events. 285/942 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4548 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1354. Up to 425 conditions per place. [2025-02-08 05:40:23,858 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 21 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2025-02-08 05:40:23,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 271 transitions, 598 flow [2025-02-08 05:40:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-08 05:40:23,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776566757493188 [2025-02-08 05:40:23,862 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 554 flow. Second operand 3 states and 855 transitions. [2025-02-08 05:40:23,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 271 transitions, 598 flow [2025-02-08 05:40:23,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 271 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:23,866 INFO L231 Difference]: Finished difference. Result has 274 places, 271 transitions, 555 flow [2025-02-08 05:40:23,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=274, PETRI_TRANSITIONS=271} [2025-02-08 05:40:23,868 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -75 predicate places. [2025-02-08 05:40:23,868 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 271 transitions, 555 flow [2025-02-08 05:40:23,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,869 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-02-08 05:40:23,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:23,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:23,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1543737019, now seen corresponding path program 1 times [2025-02-08 05:40:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353059719] [2025-02-08 05:40:23,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:40:23,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:40:23,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353059719] [2025-02-08 05:40:23,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353059719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514683884] [2025-02-08 05:40:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 367 [2025-02-08 05:40:23,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 271 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 367 [2025-02-08 05:40:23,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,129 INFO L124 PetriNetUnfolderBase]: 285/941 cut-off events. [2025-02-08 05:40:24,129 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:24,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 941 events. 285/941 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4562 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1356. Up to 426 conditions per place. [2025-02-08 05:40:24,135 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 22 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-02-08 05:40:24,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 270 transitions, 601 flow [2025-02-08 05:40:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:40:24,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7747502270663034 [2025-02-08 05:40:24,138 INFO L175 Difference]: Start difference. First operand has 274 places, 271 transitions, 555 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:40:24,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 270 transitions, 601 flow [2025-02-08 05:40:24,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 270 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:24,145 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 553 flow [2025-02-08 05:40:24,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2025-02-08 05:40:24,146 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -76 predicate places. [2025-02-08 05:40:24,146 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 553 flow [2025-02-08 05:40:24,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,147 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] [2025-02-08 05:40:24,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:24,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:24,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2142229695, now seen corresponding path program 1 times [2025-02-08 05:40:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084301006] [2025-02-08 05:40:24,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:40:24,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:40:24,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:24,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084301006] [2025-02-08 05:40:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084301006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603852483] [2025-02-08 05:40:24,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 367 [2025-02-08 05:40:24,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 553 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 367 [2025-02-08 05:40:24,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,378 INFO L124 PetriNetUnfolderBase]: 285/940 cut-off events. [2025-02-08 05:40:24,379 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:40:24,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 940 events. 285/940 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4542 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1353. Up to 423 conditions per place. [2025-02-08 05:40:24,385 INFO L140 encePairwiseOnDemand]: 365/367 looper letters, 20 selfloop transitions, 1 changer transitions 0/269 dead transitions. [2025-02-08 05:40:24,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 269 transitions, 593 flow [2025-02-08 05:40:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-02-08 05:40:24,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829246139872843 [2025-02-08 05:40:24,387 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 553 flow. Second operand 3 states and 862 transitions. [2025-02-08 05:40:24,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 269 transitions, 593 flow [2025-02-08 05:40:24,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 269 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:24,394 INFO L231 Difference]: Finished difference. Result has 272 places, 269 transitions, 549 flow [2025-02-08 05:40:24,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=272, PETRI_TRANSITIONS=269} [2025-02-08 05:40:24,395 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -77 predicate places. [2025-02-08 05:40:24,395 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 269 transitions, 549 flow [2025-02-08 05:40:24,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,395 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-02-08 05:40:24,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:24,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:24,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1011813011, now seen corresponding path program 1 times [2025-02-08 05:40:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396177238] [2025-02-08 05:40:24,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:40:24,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:40:24,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396177238] [2025-02-08 05:40:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396177238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477665318] [2025-02-08 05:40:24,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 367 [2025-02-08 05:40:24,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 269 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 367 [2025-02-08 05:40:24,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,594 INFO L124 PetriNetUnfolderBase]: 285/939 cut-off events. [2025-02-08 05:40:24,594 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:24,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 939 events. 285/939 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4542 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1352. Up to 425 conditions per place. [2025-02-08 05:40:24,600 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 21 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-08 05:40:24,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 268 transitions, 593 flow [2025-02-08 05:40:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-08 05:40:24,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776566757493188 [2025-02-08 05:40:24,603 INFO L175 Difference]: Start difference. First operand has 272 places, 269 transitions, 549 flow. Second operand 3 states and 855 transitions. [2025-02-08 05:40:24,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 268 transitions, 593 flow [2025-02-08 05:40:24,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 268 transitions, 592 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:24,607 INFO L231 Difference]: Finished difference. Result has 272 places, 268 transitions, 550 flow [2025-02-08 05:40:24,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=272, PETRI_TRANSITIONS=268} [2025-02-08 05:40:24,608 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -77 predicate places. [2025-02-08 05:40:24,608 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 268 transitions, 550 flow [2025-02-08 05:40:24,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:24,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:24,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:24,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,610 INFO L85 PathProgramCache]: Analyzing trace with hash 842204084, now seen corresponding path program 1 times [2025-02-08 05:40:24,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394166806] [2025-02-08 05:40:24,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:40:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:40:24,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394166806] [2025-02-08 05:40:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394166806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412932773] [2025-02-08 05:40:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 367 [2025-02-08 05:40:24,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 268 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 367 [2025-02-08 05:40:24,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,799 INFO L124 PetriNetUnfolderBase]: 285/938 cut-off events. [2025-02-08 05:40:24,799 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:24,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 938 events. 285/938 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4564 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1351. Up to 423 conditions per place. [2025-02-08 05:40:24,805 INFO L140 encePairwiseOnDemand]: 365/367 looper letters, 20 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2025-02-08 05:40:24,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 267 transitions, 590 flow [2025-02-08 05:40:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-02-08 05:40:24,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829246139872843 [2025-02-08 05:40:24,808 INFO L175 Difference]: Start difference. First operand has 272 places, 268 transitions, 550 flow. Second operand 3 states and 862 transitions. [2025-02-08 05:40:24,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 267 transitions, 590 flow [2025-02-08 05:40:24,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 267 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:24,812 INFO L231 Difference]: Finished difference. Result has 271 places, 267 transitions, 546 flow [2025-02-08 05:40:24,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=271, PETRI_TRANSITIONS=267} [2025-02-08 05:40:24,815 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -78 predicate places. [2025-02-08 05:40:24,815 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 267 transitions, 546 flow [2025-02-08 05:40:24,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,816 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] [2025-02-08 05:40:24,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:24,817 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:24,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2087345396, now seen corresponding path program 1 times [2025-02-08 05:40:24,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852028925] [2025-02-08 05:40:24,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:40:24,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:40:24,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:24,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852028925] [2025-02-08 05:40:24,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852028925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963522751] [2025-02-08 05:40:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 367 [2025-02-08 05:40:24,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 267 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 367 [2025-02-08 05:40:24,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,045 INFO L124 PetriNetUnfolderBase]: 285/937 cut-off events. [2025-02-08 05:40:25,045 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:25,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 937 events. 285/937 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4559 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1351. Up to 425 conditions per place. [2025-02-08 05:40:25,051 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 21 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-02-08 05:40:25,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 266 transitions, 590 flow [2025-02-08 05:40:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-08 05:40:25,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776566757493188 [2025-02-08 05:40:25,053 INFO L175 Difference]: Start difference. First operand has 271 places, 267 transitions, 546 flow. Second operand 3 states and 855 transitions. [2025-02-08 05:40:25,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 266 transitions, 590 flow [2025-02-08 05:40:25,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 266 transitions, 589 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:25,057 INFO L231 Difference]: Finished difference. Result has 271 places, 266 transitions, 547 flow [2025-02-08 05:40:25,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=271, PETRI_TRANSITIONS=266} [2025-02-08 05:40:25,058 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -78 predicate places. [2025-02-08 05:40:25,060 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 266 transitions, 547 flow [2025-02-08 05:40:25,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:25,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,061 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] [2025-02-08 05:40:25,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:25,061 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:25,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 539913640, now seen corresponding path program 1 times [2025-02-08 05:40:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911754425] [2025-02-08 05:40:25,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:40:25,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:40:25,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911754425] [2025-02-08 05:40:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911754425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625082480] [2025-02-08 05:40:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:25,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:25,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 367 [2025-02-08 05:40:25,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 266 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:25,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:25,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 367 [2025-02-08 05:40:25,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,981 INFO L124 PetriNetUnfolderBase]: 285/935 cut-off events. [2025-02-08 05:40:25,981 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:25,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 935 events. 285/935 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4542 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1373. Up to 438 conditions per place. [2025-02-08 05:40:25,987 INFO L140 encePairwiseOnDemand]: 355/367 looper letters, 34 selfloop transitions, 10 changer transitions 0/264 dead transitions. [2025-02-08 05:40:25,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 264 transitions, 631 flow [2025-02-08 05:40:25,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1582 transitions. [2025-02-08 05:40:25,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7184377838328792 [2025-02-08 05:40:25,992 INFO L175 Difference]: Start difference. First operand has 271 places, 266 transitions, 547 flow. Second operand 6 states and 1582 transitions. [2025-02-08 05:40:25,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 264 transitions, 631 flow [2025-02-08 05:40:25,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 264 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:25,997 INFO L231 Difference]: Finished difference. Result has 272 places, 264 transitions, 559 flow [2025-02-08 05:40:25,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=559, PETRI_PLACES=272, PETRI_TRANSITIONS=264} [2025-02-08 05:40:25,998 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -77 predicate places. [2025-02-08 05:40:25,998 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 264 transitions, 559 flow [2025-02-08 05:40:25,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:25,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:25,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:25,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:26,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1465935788, now seen corresponding path program 1 times [2025-02-08 05:40:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048214849] [2025-02-08 05:40:26,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:40:26,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:40:26,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048214849] [2025-02-08 05:40:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048214849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974075414] [2025-02-08 05:40:26,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 367 [2025-02-08 05:40:26,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 264 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 367 [2025-02-08 05:40:26,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,169 INFO L124 PetriNetUnfolderBase]: 285/934 cut-off events. [2025-02-08 05:40:26,169 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:26,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 934 events. 285/934 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4529 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1394. Up to 423 conditions per place. [2025-02-08 05:40:26,176 INFO L140 encePairwiseOnDemand]: 365/367 looper letters, 20 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2025-02-08 05:40:26,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 263 transitions, 599 flow [2025-02-08 05:40:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-02-08 05:40:26,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829246139872843 [2025-02-08 05:40:26,179 INFO L175 Difference]: Start difference. First operand has 272 places, 264 transitions, 559 flow. Second operand 3 states and 862 transitions. [2025-02-08 05:40:26,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 263 transitions, 599 flow [2025-02-08 05:40:26,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 263 transitions, 579 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:26,182 INFO L231 Difference]: Finished difference. Result has 268 places, 263 transitions, 539 flow [2025-02-08 05:40:26,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=268, PETRI_TRANSITIONS=263} [2025-02-08 05:40:26,183 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -81 predicate places. [2025-02-08 05:40:26,184 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 263 transitions, 539 flow [2025-02-08 05:40:26,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,184 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] [2025-02-08 05:40:26,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:26,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:26,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 189030735, now seen corresponding path program 1 times [2025-02-08 05:40:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110241090] [2025-02-08 05:40:26,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:40:26,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:40:26,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110241090] [2025-02-08 05:40:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110241090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817731170] [2025-02-08 05:40:26,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 367 [2025-02-08 05:40:26,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 263 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 367 [2025-02-08 05:40:26,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,390 INFO L124 PetriNetUnfolderBase]: 285/933 cut-off events. [2025-02-08 05:40:26,390 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:26,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 933 events. 285/933 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4544 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1348. Up to 425 conditions per place. [2025-02-08 05:40:26,396 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 21 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-02-08 05:40:26,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 262 transitions, 583 flow [2025-02-08 05:40:26,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-08 05:40:26,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776566757493188 [2025-02-08 05:40:26,399 INFO L175 Difference]: Start difference. First operand has 268 places, 263 transitions, 539 flow. Second operand 3 states and 855 transitions. [2025-02-08 05:40:26,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 262 transitions, 583 flow [2025-02-08 05:40:26,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 262 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:26,403 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 540 flow [2025-02-08 05:40:26,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2025-02-08 05:40:26,404 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -81 predicate places. [2025-02-08 05:40:26,404 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 540 flow [2025-02-08 05:40:26,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:26,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:26,405 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:26,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash 656056604, now seen corresponding path program 1 times [2025-02-08 05:40:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603386289] [2025-02-08 05:40:26,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:40:26,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:40:26,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603386289] [2025-02-08 05:40:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603386289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033580565] [2025-02-08 05:40:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 367 [2025-02-08 05:40:26,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 367 [2025-02-08 05:40:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,590 INFO L124 PetriNetUnfolderBase]: 285/932 cut-off events. [2025-02-08 05:40:26,590 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:26,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 932 events. 285/932 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4515 event pairs, 221 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1347. Up to 423 conditions per place. [2025-02-08 05:40:26,595 INFO L140 encePairwiseOnDemand]: 365/367 looper letters, 20 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2025-02-08 05:40:26,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 261 transitions, 580 flow [2025-02-08 05:40:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-02-08 05:40:26,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829246139872843 [2025-02-08 05:40:26,598 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 540 flow. Second operand 3 states and 862 transitions. [2025-02-08 05:40:26,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 261 transitions, 580 flow [2025-02-08 05:40:26,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 261 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:26,601 INFO L231 Difference]: Finished difference. Result has 267 places, 261 transitions, 536 flow [2025-02-08 05:40:26,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=267, PETRI_TRANSITIONS=261} [2025-02-08 05:40:26,602 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -82 predicate places. [2025-02-08 05:40:26,602 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 261 transitions, 536 flow [2025-02-08 05:40:26,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,603 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] [2025-02-08 05:40:26,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:26,603 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:26,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash -355739485, now seen corresponding path program 1 times [2025-02-08 05:40:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747879578] [2025-02-08 05:40:26,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 05:40:26,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 05:40:26,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747879578] [2025-02-08 05:40:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747879578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378462172] [2025-02-08 05:40:26,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 367 [2025-02-08 05:40:26,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 261 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 367 [2025-02-08 05:40:26,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,808 INFO L124 PetriNetUnfolderBase]: 294/995 cut-off events. [2025-02-08 05:40:26,809 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2025-02-08 05:40:26,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 995 events. 294/995 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4837 event pairs, 185 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1427. Up to 433 conditions per place. [2025-02-08 05:40:26,814 INFO L140 encePairwiseOnDemand]: 361/367 looper letters, 24 selfloop transitions, 5 changer transitions 0/268 dead transitions. [2025-02-08 05:40:26,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 268 transitions, 612 flow [2025-02-08 05:40:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2025-02-08 05:40:26,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7901907356948229 [2025-02-08 05:40:26,817 INFO L175 Difference]: Start difference. First operand has 267 places, 261 transitions, 536 flow. Second operand 3 states and 870 transitions. [2025-02-08 05:40:26,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 268 transitions, 612 flow [2025-02-08 05:40:26,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 611 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:26,825 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 564 flow [2025-02-08 05:40:26,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2025-02-08 05:40:26,826 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -81 predicate places. [2025-02-08 05:40:26,826 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 564 flow [2025-02-08 05:40:26,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,827 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] [2025-02-08 05:40:26,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:26,827 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-02-08 05:40:26,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash -184542971, now seen corresponding path program 1 times [2025-02-08 05:40:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890965670] [2025-02-08 05:40:26,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:40:26,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:40:26,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890965670] [2025-02-08 05:40:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890965670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222950688] [2025-02-08 05:40:26,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 367 [2025-02-08 05:40:26,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-02-08 05:40:26,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 367 [2025-02-08 05:40:26,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,088 INFO L124 PetriNetUnfolderBase]: 294/1079 cut-off events. [2025-02-08 05:40:27,089 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-02-08 05:40:27,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 1079 events. 294/1079 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5749 event pairs, 191 based on Foata normal form. 1/955 useless extension candidates. Maximal degree in co-relation 1694. Up to 436 conditions per place. [2025-02-08 05:40:27,092 INFO L140 encePairwiseOnDemand]: 365/367 looper letters, 0 selfloop transitions, 0 changer transitions 263/263 dead transitions. [2025-02-08 05:40:27,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 263 transitions, 608 flow [2025-02-08 05:40:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 863 transitions. [2025-02-08 05:40:27,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838328792007266 [2025-02-08 05:40:27,095 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 564 flow. Second operand 3 states and 863 transitions. [2025-02-08 05:40:27,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 263 transitions, 608 flow [2025-02-08 05:40:27,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 263 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:27,098 INFO L231 Difference]: Finished difference. Result has 269 places, 0 transitions, 0 flow [2025-02-08 05:40:27,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=269, PETRI_TRANSITIONS=0} [2025-02-08 05:40:27,099 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -80 predicate places. [2025-02-08 05:40:27,099 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 0 transitions, 0 flow [2025-02-08 05:40:27,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-02-08 05:40:27,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (128 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (127 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (123 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2025-02-08 05:40:27,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (114 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (110 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2025-02-08 05:40:27,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (95 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (93 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (92 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2025-02-08 05:40:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2025-02-08 05:40:27,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2025-02-08 05:40:27,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 135 remaining) [2025-02-08 05:40:27,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (69 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2025-02-08 05:40:27,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (59 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (58 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (57 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2025-02-08 05:40:27,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (37 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2025-02-08 05:40:27,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2025-02-08 05:40:27,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (16 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (9 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (4 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2025-02-08 05:40:27,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2025-02-08 05:40:27,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:40:27,111 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:27,117 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:27,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:27,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:27 BasicIcfg [2025-02-08 05:40:27,125 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:27,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:27,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:27,126 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:27,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:20" (3/4) ... [2025-02-08 05:40:27,127 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:27,130 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:27,130 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:27,130 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:27,130 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:40:27,136 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-02-08 05:40:27,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:27,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:40:27,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:27,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:27,225 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:27,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:27,226 INFO L158 Benchmark]: Toolchain (without parser) took 8147.77ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 122.9MB in the beginning and 343.8MB in the end (delta: -220.9MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,226 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:27,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.45ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 108.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.24ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 105.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:27,227 INFO L158 Benchmark]: Boogie Preprocessor took 42.58ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 102.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:27,227 INFO L158 Benchmark]: IcfgBuilder took 1440.03ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 75.7MB in the end (delta: 27.0MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,228 INFO L158 Benchmark]: TraceAbstraction took 6177.90ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 75.7MB in the beginning and 348.0MB in the end (delta: -272.4MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,228 INFO L158 Benchmark]: Witness Printer took 99.22ms. Allocated memory is still 461.4MB. Free memory was 348.0MB in the beginning and 343.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:27,229 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.27ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.45ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 108.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.24ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 105.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.58ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 102.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1440.03ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 75.7MB in the end (delta: 27.0MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6177.90ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 75.7MB in the beginning and 348.0MB in the end (delta: -272.4MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. * Witness Printer took 99.22ms. Allocated memory is still 461.4MB. Free memory was 348.0MB in the beginning and 343.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: 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: 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: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: 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: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: 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: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: 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 9 procedures, 451 locations, 135 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: 6.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 357 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 73 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=716occurred in iteration=0, InterpolantAutomatonStates: 57, 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.3s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 89 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:27,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE