./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.i --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/pthread-lit/sssc12.i -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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:26:36,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:26:36,544 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:26:36,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:26:36,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:26:36,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:26:36,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:26:36,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:26:36,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:26:36,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:26:36,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:26:36,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:26:36,564 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:26:36,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:26:36,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:26:36,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:26:36,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:26:36,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:26:36,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:26:36,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:36,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:26:36,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:26:36,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:26:36,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:26:36,567 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-02-08 05:26:36,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:26:36,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:26:36,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:26:36,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:26:36,792 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:26:36,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-02-08 05:26:37,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d665cd85/003c30a5d0e043fb99e52e3979b3c6f6/FLAG76c2a308d [2025-02-08 05:26:38,329 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:26:38,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-02-08 05:26:38,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d665cd85/003c30a5d0e043fb99e52e3979b3c6f6/FLAG76c2a308d [2025-02-08 05:26:38,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d665cd85/003c30a5d0e043fb99e52e3979b3c6f6 [2025-02-08 05:26:38,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:26:38,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:26:38,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:38,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:26:38,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:26:38,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38, skipping insertion in model container [2025-02-08 05:26:38,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:26:38,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:38,748 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:26:38,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:38,814 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:26:38,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38 WrapperNode [2025-02-08 05:26:38,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:38,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:38,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:26:38,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:26:38,820 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:26:38" (1/1) ... [2025-02-08 05:26:38,829 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:26:38" (1/1) ... [2025-02-08 05:26:38,846 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-02-08 05:26:38,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:38,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:26:38,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:26:38,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:26:38,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:26:38,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:26:38,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:26:38,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:26:38,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (1/1) ... [2025-02-08 05:26:38,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:38,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:26:38,888 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:26:38,893 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:26:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-02-08 05:26:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-02-08 05:26:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:26:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:26:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:26:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:26:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:26:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:26:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:26:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:26:38,907 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:26:38,995 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:26:38,996 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:26:39,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047: assume { :end_inline___VERIFIER_assert } true;havoc #t~short7#1; [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-1: havoc __VERIFIER_assert_#in~cond#1; [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-2: havoc __VERIFIER_assert_~cond#1; [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: assume ((#race[~data~0.base,~data~0.offset + 4 * ~c~0#1] == #t~nondet8#1 && #race[~data~0.base,1 + (~data~0.offset + 4 * ~c~0#1)] == #t~nondet8#1) && #race[~data~0.base,2 + (~data~0.offset + 4 * ~c~0#1)] == #t~nondet8#1) && #race[~data~0.base,3 + (~data~0.offset + 4 * ~c~0#1)] == #t~nondet8#1; [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: assume !(((#race[~data~0.base,~data~0.offset + 4 * ~c~0#1] == #t~nondet8#1 && #race[~data~0.base,1 + (~data~0.offset + 4 * ~c~0#1)] == #t~nondet8#1) && #race[~data~0.base,2 + (~data~0.offset + 4 * ~c~0#1)] == #t~nondet8#1) && #race[~data~0.base,3 + (~data~0.offset + 4 * ~c~0#1)] == #t~nondet8#1); [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: havoc #t~nondet8#1; [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-2: #race := #race[~data~0.base,3 + (~data~0.offset + 4 * ~c~0#1) := #t~nondet8#1]; [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-3: #race := #race[~data~0.base,2 + (~data~0.offset + 4 * ~c~0#1) := #t~nondet8#1]; [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-4: #race := #race[~data~0.base,1 + (~data~0.offset + 4 * ~c~0#1) := #t~nondet8#1]; [2025-02-08 05:26:39,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-5: #race := #race[~data~0.base,~data~0.offset + 4 * ~c~0#1 := #t~nondet8#1]; [2025-02-08 05:26:39,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-6: havoc #t~nondet8#1; [2025-02-08 05:26:39,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-7: SUMMARY for call write~int(0, ~data~0.base, ~data~0.offset + 4 * ~c~0#1, 4); srcloc: null [2025-02-08 05:26:39,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-8: assume 0 == #race~data~0; [2025-02-08 05:26:39,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-8: assume !(0 == #race~data~0); [2025-02-08 05:26:39,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-9: #race~data~0 := 0; [2025-02-08 05:26:39,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: ~c~0#1 := 1 + ~c~0#1; [2025-02-08 05:26:39,228 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:26:39,228 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:26:39,243 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:26:39,244 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:26:39,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:39 BoogieIcfgContainer [2025-02-08 05:26:39,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:26:39,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:26:39,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:26:39,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:26:39,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:26:38" (1/3) ... [2025-02-08 05:26:39,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db325f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:39, skipping insertion in model container [2025-02-08 05:26:39,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:38" (2/3) ... [2025-02-08 05:26:39,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db325f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:39, skipping insertion in model container [2025-02-08 05:26:39,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:39" (3/3) ... [2025-02-08 05:26:39,250 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-02-08 05:26:39,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:26:39,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 123 locations, 1 initial locations, 2 loop locations, and 14 error locations. [2025-02-08 05:26:39,261 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:26:39,298 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:39,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 129 transitions, 262 flow [2025-02-08 05:26:39,356 INFO L124 PetriNetUnfolderBase]: 6/137 cut-off events. [2025-02-08 05:26:39,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:39,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 137 events. 6/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 146 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-02-08 05:26:39,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 129 transitions, 262 flow [2025-02-08 05:26:39,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 129 transitions, 262 flow [2025-02-08 05:26:39,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:39,378 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;@4d787a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:39,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 05:26:39,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:39,384 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:26:39,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:39,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:39,385 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] [2025-02-08 05:26:39,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:26:39,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1822071330, now seen corresponding path program 1 times [2025-02-08 05:26:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370294448] [2025-02-08 05:26:39,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:39,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:26:39,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:26:39,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:39,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:39,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370294448] [2025-02-08 05:26:39,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370294448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:39,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:39,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540273047] [2025-02-08 05:26:39,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:39,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:39,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:39,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:39,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 129 [2025-02-08 05:26:39,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 129 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:26:39,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:39,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 129 [2025-02-08 05:26:39,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:39,677 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2025-02-08 05:26:39,677 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:39,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 121 events. 3/121 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 70. Up to 11 conditions per place. [2025-02-08 05:26:39,679 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 10 selfloop transitions, 2 changer transitions 1/118 dead transitions. [2025-02-08 05:26:39,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 264 flow [2025-02-08 05:26:39,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2025-02-08 05:26:39,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.896640826873385 [2025-02-08 05:26:39,689 INFO L175 Difference]: Start difference. First operand has 126 places, 129 transitions, 262 flow. Second operand 3 states and 347 transitions. [2025-02-08 05:26:39,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 264 flow [2025-02-08 05:26:39,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 118 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:26:39,695 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 242 flow [2025-02-08 05:26:39,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-02-08 05:26:39,699 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -6 predicate places. [2025-02-08 05:26:39,699 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 242 flow [2025-02-08 05:26:39,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:26:39,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:39,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:39,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:26:39,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:26:39,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1141197253, now seen corresponding path program 1 times [2025-02-08 05:26:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:39,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582311532] [2025-02-08 05:26:39,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:39,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:26:39,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:26:39,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:39,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:39,742 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:26:39,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582311532] [2025-02-08 05:26:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582311532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:39,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:39,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514110255] [2025-02-08 05:26:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:39,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:39,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:39,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:39,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:39,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 129 [2025-02-08 05:26:39,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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:26:39,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:39,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 129 [2025-02-08 05:26:39,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:39,829 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2025-02-08 05:26:39,829 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:39,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 119 events. 3/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 109. Up to 12 conditions per place. [2025-02-08 05:26:39,830 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 11 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-02-08 05:26:39,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 266 flow [2025-02-08 05:26:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2025-02-08 05:26:39,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8811369509043928 [2025-02-08 05:26:39,832 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 242 flow. Second operand 3 states and 341 transitions. [2025-02-08 05:26:39,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 266 flow [2025-02-08 05:26:39,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 116 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:39,834 INFO L231 Difference]: Finished difference. Result has 118 places, 116 transitions, 240 flow [2025-02-08 05:26:39,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=118, PETRI_TRANSITIONS=116} [2025-02-08 05:26:39,835 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -8 predicate places. [2025-02-08 05:26:39,835 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 116 transitions, 240 flow [2025-02-08 05:26:39,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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:26:39,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:39,836 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] [2025-02-08 05:26:39,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:26:39,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:26:39,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash -916096038, now seen corresponding path program 1 times [2025-02-08 05:26:39,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:39,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926885155] [2025-02-08 05:26:39,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:39,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:39,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:26:39,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:26:39,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:39,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:39,875 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:26:39,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926885155] [2025-02-08 05:26:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926885155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:39,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:39,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:39,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448558567] [2025-02-08 05:26:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:39,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:39,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:39,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:39,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 129 [2025-02-08 05:26:39,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:26:39,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:39,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 129 [2025-02-08 05:26:39,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:39,923 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2025-02-08 05:26:39,923 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:26:39,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 114 events. 3/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 97. Up to 13 conditions per place. [2025-02-08 05:26:39,924 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 13 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2025-02-08 05:26:39,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 111 transitions, 258 flow [2025-02-08 05:26:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2025-02-08 05:26:39,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630490956072352 [2025-02-08 05:26:39,925 INFO L175 Difference]: Start difference. First operand has 118 places, 116 transitions, 240 flow. Second operand 3 states and 334 transitions. [2025-02-08 05:26:39,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 111 transitions, 258 flow [2025-02-08 05:26:39,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 111 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:39,927 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 228 flow [2025-02-08 05:26:39,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2025-02-08 05:26:39,928 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -13 predicate places. [2025-02-08 05:26:39,928 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 228 flow [2025-02-08 05:26:39,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:26:39,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:39,929 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] [2025-02-08 05:26:39,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:26:39,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:26:39,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 707360795, now seen corresponding path program 1 times [2025-02-08 05:26:39,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:39,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123579044] [2025-02-08 05:26:39,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:39,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:26:39,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:26:39,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:39,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:39,981 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:26:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123579044] [2025-02-08 05:26:39,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123579044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:39,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:39,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129006] [2025-02-08 05:26:39,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:39,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:39,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:39,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:39,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2025-02-08 05:26:39,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:26:39,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:39,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2025-02-08 05:26:39,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,011 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2025-02-08 05:26:40,011 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:40,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 113 events. 3/113 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 89. Up to 7 conditions per place. [2025-02-08 05:26:40,012 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 6 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-02-08 05:26:40,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 110 transitions, 242 flow [2025-02-08 05:26:40,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2025-02-08 05:26:40,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069767441860465 [2025-02-08 05:26:40,013 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 228 flow. Second operand 3 states and 351 transitions. [2025-02-08 05:26:40,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 110 transitions, 242 flow [2025-02-08 05:26:40,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 110 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:40,015 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 229 flow [2025-02-08 05:26:40,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2025-02-08 05:26:40,016 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -13 predicate places. [2025-02-08 05:26:40,016 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 229 flow [2025-02-08 05:26:40,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:26:40,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,017 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:40,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:26:40,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:26:40,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash -153363805, now seen corresponding path program 1 times [2025-02-08 05:26:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666727145] [2025-02-08 05:26:40,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:26:40,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:26:40,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,161 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:26:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666727145] [2025-02-08 05:26:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666727145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:26:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055236318] [2025-02-08 05:26:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:26:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:26:40,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:26:40,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2025-02-08 05:26:40,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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:26:40,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2025-02-08 05:26:40,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,222 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2025-02-08 05:26:40,223 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:40,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 116 events. 2/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 104. Up to 15 conditions per place. [2025-02-08 05:26:40,223 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 14 selfloop transitions, 0 changer transitions 4/113 dead transitions. [2025-02-08 05:26:40,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 271 flow [2025-02-08 05:26:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:26:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:26:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2025-02-08 05:26:40,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8589147286821706 [2025-02-08 05:26:40,225 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 229 flow. Second operand 5 states and 554 transitions. [2025-02-08 05:26:40,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 271 flow [2025-02-08 05:26:40,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:40,228 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 229 flow [2025-02-08 05:26:40,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2025-02-08 05:26:40,228 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -8 predicate places. [2025-02-08 05:26:40,228 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 229 flow [2025-02-08 05:26:40,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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:26:40,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,229 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:40,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:26:40,229 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:26:40,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1262170829, now seen corresponding path program 1 times [2025-02-08 05:26:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543253786] [2025-02-08 05:26:40,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:26:40,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:26:40,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:40,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:40,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:26:40,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:26:40,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:40,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:40,283 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:40,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-02-08 05:26:40,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-02-08 05:26:40,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-02-08 05:26:40,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-02-08 05:26:40,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-02-08 05:26:40,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:26:40,293 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:26:40,295 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:26:40,295 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:26:40,325 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:40,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 183 transitions, 376 flow [2025-02-08 05:26:40,354 INFO L124 PetriNetUnfolderBase]: 10/201 cut-off events. [2025-02-08 05:26:40,355 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:26:40,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 201 events. 10/201 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 421 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 138. Up to 3 conditions per place. [2025-02-08 05:26:40,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 183 transitions, 376 flow [2025-02-08 05:26:40,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 183 transitions, 376 flow [2025-02-08 05:26:40,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:40,363 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;@4d787a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:40,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-08 05:26:40,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:40,367 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:26:40,367 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:40,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,367 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] [2025-02-08 05:26:40,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:26:40,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -512825611, now seen corresponding path program 1 times [2025-02-08 05:26:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148206422] [2025-02-08 05:26:40,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:26:40,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:26:40,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,408 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:26:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148206422] [2025-02-08 05:26:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148206422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903792960] [2025-02-08 05:26:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 183 [2025-02-08 05:26:40,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 183 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:26:40,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 183 [2025-02-08 05:26:40,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,527 INFO L124 PetriNetUnfolderBase]: 61/526 cut-off events. [2025-02-08 05:26:40,531 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:26:40,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 526 events. 61/526 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2864 event pairs, 42 based on Foata normal form. 84/513 useless extension candidates. Maximal degree in co-relation 487. Up to 102 conditions per place. [2025-02-08 05:26:40,541 INFO L140 encePairwiseOnDemand]: 174/183 looper letters, 17 selfloop transitions, 2 changer transitions 1/168 dead transitions. [2025-02-08 05:26:40,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 168 transitions, 384 flow [2025-02-08 05:26:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-02-08 05:26:40,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-02-08 05:26:40,542 INFO L175 Difference]: Start difference. First operand has 178 places, 183 transitions, 376 flow. Second operand 3 states and 488 transitions. [2025-02-08 05:26:40,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 168 transitions, 384 flow [2025-02-08 05:26:40,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:26:40,546 INFO L231 Difference]: Finished difference. Result has 170 places, 167 transitions, 348 flow [2025-02-08 05:26:40,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=170, PETRI_TRANSITIONS=167} [2025-02-08 05:26:40,547 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, -8 predicate places. [2025-02-08 05:26:40,549 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 348 flow [2025-02-08 05:26:40,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:26:40,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:40,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:26:40,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:26:40,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1443387163, now seen corresponding path program 1 times [2025-02-08 05:26:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-02-08 05:26:40,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:26:40,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:26:40,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,581 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:26:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-02-08 05:26:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452200728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112929095] [2025-02-08 05:26:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 183 [2025-02-08 05:26:40,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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:26:40,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 183 [2025-02-08 05:26:40,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,689 INFO L124 PetriNetUnfolderBase]: 35/414 cut-off events. [2025-02-08 05:26:40,689 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:26:40,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 414 events. 35/414 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1888 event pairs, 20 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 464. Up to 57 conditions per place. [2025-02-08 05:26:40,691 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 16 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-02-08 05:26:40,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 382 flow [2025-02-08 05:26:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-02-08 05:26:40,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8816029143897997 [2025-02-08 05:26:40,692 INFO L175 Difference]: Start difference. First operand has 170 places, 167 transitions, 348 flow. Second operand 3 states and 484 transitions. [2025-02-08 05:26:40,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 382 flow [2025-02-08 05:26:40,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:40,694 INFO L231 Difference]: Finished difference. Result has 168 places, 166 transitions, 346 flow [2025-02-08 05:26:40,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=168, PETRI_TRANSITIONS=166} [2025-02-08 05:26:40,695 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, -10 predicate places. [2025-02-08 05:26:40,695 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 346 flow [2025-02-08 05:26:40,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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:26:40,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,696 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] [2025-02-08 05:26:40,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:26:40,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:26:40,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,697 INFO L85 PathProgramCache]: Analyzing trace with hash 589906106, now seen corresponding path program 1 times [2025-02-08 05:26:40,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428168890] [2025-02-08 05:26:40,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:26:40,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:26:40,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,715 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:26:40,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428168890] [2025-02-08 05:26:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428168890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645474257] [2025-02-08 05:26:40,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2025-02-08 05:26:40,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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:26:40,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2025-02-08 05:26:40,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,793 INFO L124 PetriNetUnfolderBase]: 63/551 cut-off events. [2025-02-08 05:26:40,793 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 05:26:40,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 551 events. 63/551 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3022 event pairs, 42 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 646. Up to 104 conditions per place. [2025-02-08 05:26:40,796 INFO L140 encePairwiseOnDemand]: 175/183 looper letters, 20 selfloop transitions, 1 changer transitions 0/159 dead transitions. [2025-02-08 05:26:40,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 374 flow [2025-02-08 05:26:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-02-08 05:26:40,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-02-08 05:26:40,798 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 346 flow. Second operand 3 states and 469 transitions. [2025-02-08 05:26:40,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 374 flow [2025-02-08 05:26:40,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:40,801 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 330 flow [2025-02-08 05:26:40,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2025-02-08 05:26:40,802 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, -17 predicate places. [2025-02-08 05:26:40,802 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 330 flow [2025-02-08 05:26:40,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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:26:40,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:40,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:26:40,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:26:40,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1829104645, now seen corresponding path program 1 times [2025-02-08 05:26:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406490952] [2025-02-08 05:26:40,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:26:40,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:26:40,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,830 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:26:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406490952] [2025-02-08 05:26:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406490952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362427900] [2025-02-08 05:26:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 183 [2025-02-08 05:26:40,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:26:40,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 183 [2025-02-08 05:26:40,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:40,873 INFO L124 PetriNetUnfolderBase]: 17/298 cut-off events. [2025-02-08 05:26:40,874 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:26:40,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 298 events. 17/298 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1082 event pairs, 6 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 298. Up to 22 conditions per place. [2025-02-08 05:26:40,875 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 9 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2025-02-08 05:26:40,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 350 flow [2025-02-08 05:26:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-02-08 05:26:40,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907103825136612 [2025-02-08 05:26:40,877 INFO L175 Difference]: Start difference. First operand has 161 places, 159 transitions, 330 flow. Second operand 3 states and 498 transitions. [2025-02-08 05:26:40,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 350 flow [2025-02-08 05:26:40,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:40,879 INFO L231 Difference]: Finished difference. Result has 161 places, 158 transitions, 331 flow [2025-02-08 05:26:40,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2025-02-08 05:26:40,880 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, -17 predicate places. [2025-02-08 05:26:40,880 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 331 flow [2025-02-08 05:26:40,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:26:40,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:40,881 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] [2025-02-08 05:26:40,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:26:40,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:26:40,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash -969404426, now seen corresponding path program 1 times [2025-02-08 05:26:40,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:40,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-02-08 05:26:40,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:40,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:26:40,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:26:40,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:40,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:40,919 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:26:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:40,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-02-08 05:26:40,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762076163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:40,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:40,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:40,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384588570] [2025-02-08 05:26:40,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:40,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:40,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:40,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:40,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:40,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2025-02-08 05:26:40,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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:26:40,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:40,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2025-02-08 05:26:40,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:41,065 INFO L124 PetriNetUnfolderBase]: 164/1099 cut-off events. [2025-02-08 05:26:41,066 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:26:41,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1099 events. 164/1099 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7717 event pairs, 57 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 1389. Up to 204 conditions per place. [2025-02-08 05:26:41,075 INFO L140 encePairwiseOnDemand]: 163/183 looper letters, 32 selfloop transitions, 14 changer transitions 0/177 dead transitions. [2025-02-08 05:26:41,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 177 transitions, 466 flow [2025-02-08 05:26:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-02-08 05:26:41,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9034608378870674 [2025-02-08 05:26:41,077 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 331 flow. Second operand 3 states and 496 transitions. [2025-02-08 05:26:41,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 177 transitions, 466 flow [2025-02-08 05:26:41,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 177 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:41,080 INFO L231 Difference]: Finished difference. Result has 163 places, 172 transitions, 451 flow [2025-02-08 05:26:41,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=163, PETRI_TRANSITIONS=172} [2025-02-08 05:26:41,081 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, -15 predicate places. [2025-02-08 05:26:41,081 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 172 transitions, 451 flow [2025-02-08 05:26:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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:26:41,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,082 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:41,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:26:41,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:26:41,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash -481293816, now seen corresponding path program 1 times [2025-02-08 05:26:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184514898] [2025-02-08 05:26:41,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:26:41,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:26:41,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:41,200 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:26:41,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184514898] [2025-02-08 05:26:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184514898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:41,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:26:41,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160353192] [2025-02-08 05:26:41,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:41,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:26:41,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:41,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:26:41,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:26:41,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 183 [2025-02-08 05:26:41,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 172 transitions, 451 flow. Second operand has 5 states, 5 states have (on average 157.4) internal successors, (787), 5 states have internal predecessors, (787), 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:26:41,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:41,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 183 [2025-02-08 05:26:41,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:41,327 INFO L124 PetriNetUnfolderBase]: 99/996 cut-off events. [2025-02-08 05:26:41,327 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:26:41,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 996 events. 99/996 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6867 event pairs, 41 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 1228. Up to 120 conditions per place. [2025-02-08 05:26:41,333 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 17 selfloop transitions, 0 changer transitions 4/175 dead transitions. [2025-02-08 05:26:41,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 175 transitions, 499 flow [2025-02-08 05:26:41,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:26:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:26:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 797 transitions. [2025-02-08 05:26:41,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8710382513661202 [2025-02-08 05:26:41,336 INFO L175 Difference]: Start difference. First operand has 163 places, 172 transitions, 451 flow. Second operand 5 states and 797 transitions. [2025-02-08 05:26:41,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 175 transitions, 499 flow [2025-02-08 05:26:41,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 175 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:41,341 INFO L231 Difference]: Finished difference. Result has 168 places, 171 transitions, 427 flow [2025-02-08 05:26:41,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=168, PETRI_TRANSITIONS=171} [2025-02-08 05:26:41,342 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, -10 predicate places. [2025-02-08 05:26:41,343 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 171 transitions, 427 flow [2025-02-08 05:26:41,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.4) internal successors, (787), 5 states have internal predecessors, (787), 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:26:41,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,344 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:41,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:26:41,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:26:41,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2035508497, now seen corresponding path program 1 times [2025-02-08 05:26:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392377231] [2025-02-08 05:26:41,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:26:41,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:26:41,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:41,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:41,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:26:41,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:26:41,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:41,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:41,383 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:41,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-02-08 05:26:41,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-02-08 05:26:41,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-02-08 05:26:41,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-02-08 05:26:41,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-02-08 05:26:41,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-02-08 05:26:41,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-02-08 05:26:41,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-02-08 05:26:41,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-02-08 05:26:41,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-02-08 05:26:41,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-02-08 05:26:41,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-02-08 05:26:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:26:41,385 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:41,385 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:26:41,386 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:26:41,426 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:41,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 237 transitions, 492 flow [2025-02-08 05:26:41,482 INFO L124 PetriNetUnfolderBase]: 14/265 cut-off events. [2025-02-08 05:26:41,483 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:26:41,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 265 events. 14/265 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 754 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 205. Up to 4 conditions per place. [2025-02-08 05:26:41,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 237 transitions, 492 flow [2025-02-08 05:26:41,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 237 transitions, 492 flow [2025-02-08 05:26:41,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:41,487 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;@4d787a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:41,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-08 05:26:41,490 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:41,490 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:26:41,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:41,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,490 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] [2025-02-08 05:26:41,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:26:41,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1534801410, now seen corresponding path program 1 times [2025-02-08 05:26:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352855409] [2025-02-08 05:26:41,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:26:41,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:26:41,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:41,508 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:26:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352855409] [2025-02-08 05:26:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352855409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:41,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055899411] [2025-02-08 05:26:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:41,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:41,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:41,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:41,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 237 [2025-02-08 05:26:41,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 237 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:26:41,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:41,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 237 [2025-02-08 05:26:41,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:41,841 INFO L124 PetriNetUnfolderBase]: 763/3633 cut-off events. [2025-02-08 05:26:41,842 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-02-08 05:26:41,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 3633 events. 763/3633 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 35233 event pairs, 630 based on Foata normal form. 685/3651 useless extension candidates. Maximal degree in co-relation 3950. Up to 1033 conditions per place. [2025-02-08 05:26:41,878 INFO L140 encePairwiseOnDemand]: 226/237 looper letters, 24 selfloop transitions, 2 changer transitions 1/218 dead transitions. [2025-02-08 05:26:41,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 506 flow [2025-02-08 05:26:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2025-02-08 05:26:41,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8846694796061885 [2025-02-08 05:26:41,880 INFO L175 Difference]: Start difference. First operand has 230 places, 237 transitions, 492 flow. Second operand 3 states and 629 transitions. [2025-02-08 05:26:41,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 218 transitions, 506 flow [2025-02-08 05:26:41,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 218 transitions, 504 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:26:41,884 INFO L231 Difference]: Finished difference. Result has 220 places, 217 transitions, 454 flow [2025-02-08 05:26:41,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=220, PETRI_TRANSITIONS=217} [2025-02-08 05:26:41,886 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -10 predicate places. [2025-02-08 05:26:41,886 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 217 transitions, 454 flow [2025-02-08 05:26:41,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:26:41,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:41,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:26:41,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:26:41,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1757429061, now seen corresponding path program 1 times [2025-02-08 05:26:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-02-08 05:26:41,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:26:41,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:26:41,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:41,916 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:26:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-02-08 05:26:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169925182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:41,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:41,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704404200] [2025-02-08 05:26:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:41,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:41,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:41,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:41,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 237 [2025-02-08 05:26:41,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 217 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 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:26:41,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:41,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 237 [2025-02-08 05:26:41,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,128 INFO L124 PetriNetUnfolderBase]: 297/1989 cut-off events. [2025-02-08 05:26:42,130 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-02-08 05:26:42,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2472 conditions, 1989 events. 297/1989 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 16894 event pairs, 220 based on Foata normal form. 0/1604 useless extension candidates. Maximal degree in co-relation 2439. Up to 382 conditions per place. [2025-02-08 05:26:42,144 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 21 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-02-08 05:26:42,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 216 transitions, 498 flow [2025-02-08 05:26:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2025-02-08 05:26:42,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8818565400843882 [2025-02-08 05:26:42,149 INFO L175 Difference]: Start difference. First operand has 220 places, 217 transitions, 454 flow. Second operand 3 states and 627 transitions. [2025-02-08 05:26:42,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 216 transitions, 498 flow [2025-02-08 05:26:42,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 216 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:42,152 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 452 flow [2025-02-08 05:26:42,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2025-02-08 05:26:42,153 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -12 predicate places. [2025-02-08 05:26:42,153 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 452 flow [2025-02-08 05:26:42,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 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:26:42,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,154 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] [2025-02-08 05:26:42,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:26:42,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:26:42,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1765800026, now seen corresponding path program 1 times [2025-02-08 05:26:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825914070] [2025-02-08 05:26:42,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:26:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:26:42,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:42,178 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:26:42,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825914070] [2025-02-08 05:26:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825914070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:42,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:42,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4301212] [2025-02-08 05:26:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:42,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:42,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:42,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:42,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:42,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 237 [2025-02-08 05:26:42,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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:26:42,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 237 [2025-02-08 05:26:42,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,489 INFO L124 PetriNetUnfolderBase]: 777/3964 cut-off events. [2025-02-08 05:26:42,490 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-02-08 05:26:42,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5178 conditions, 3964 events. 777/3964 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 39498 event pairs, 630 based on Foata normal form. 0/3333 useless extension candidates. Maximal degree in co-relation 5137. Up to 1035 conditions per place. [2025-02-08 05:26:42,517 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 27 selfloop transitions, 1 changer transitions 0/207 dead transitions. [2025-02-08 05:26:42,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 207 transitions, 490 flow [2025-02-08 05:26:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2025-02-08 05:26:42,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849507735583685 [2025-02-08 05:26:42,519 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 452 flow. Second operand 3 states and 604 transitions. [2025-02-08 05:26:42,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 207 transitions, 490 flow [2025-02-08 05:26:42,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 207 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:42,523 INFO L231 Difference]: Finished difference. Result has 209 places, 207 transitions, 432 flow [2025-02-08 05:26:42,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=209, PETRI_TRANSITIONS=207} [2025-02-08 05:26:42,526 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -21 predicate places. [2025-02-08 05:26:42,526 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 207 transitions, 432 flow [2025-02-08 05:26:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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:26:42,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,526 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] [2025-02-08 05:26:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:26:42,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:26:42,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash -607840101, now seen corresponding path program 1 times [2025-02-08 05:26:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318622845] [2025-02-08 05:26:42,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:26:42,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:26:42,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:42,560 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:26:42,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:42,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318622845] [2025-02-08 05:26:42,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318622845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:42,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:42,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:42,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251911997] [2025-02-08 05:26:42,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:42,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:42,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:42,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:42,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 237 [2025-02-08 05:26:42,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 207 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 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:26:42,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 237 [2025-02-08 05:26:42,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,699 INFO L124 PetriNetUnfolderBase]: 79/891 cut-off events. [2025-02-08 05:26:42,699 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-08 05:26:42,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 891 events. 79/891 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5966 event pairs, 42 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 981. Up to 85 conditions per place. [2025-02-08 05:26:42,712 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 12 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2025-02-08 05:26:42,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 206 transitions, 458 flow [2025-02-08 05:26:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2025-02-08 05:26:42,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071729957805907 [2025-02-08 05:26:42,715 INFO L175 Difference]: Start difference. First operand has 209 places, 207 transitions, 432 flow. Second operand 3 states and 645 transitions. [2025-02-08 05:26:42,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 206 transitions, 458 flow [2025-02-08 05:26:42,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 206 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:42,722 INFO L231 Difference]: Finished difference. Result has 209 places, 206 transitions, 433 flow [2025-02-08 05:26:42,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=209, PETRI_TRANSITIONS=206} [2025-02-08 05:26:42,722 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -21 predicate places. [2025-02-08 05:26:42,722 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 206 transitions, 433 flow [2025-02-08 05:26:42,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 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:26:42,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,723 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] [2025-02-08 05:26:42,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:26:42,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:26:42,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 29926041, now seen corresponding path program 1 times [2025-02-08 05:26:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279901324] [2025-02-08 05:26:42,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:26:42,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:26:42,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:42,773 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:26:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279901324] [2025-02-08 05:26:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279901324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:42,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651133264] [2025-02-08 05:26:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:42,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:42,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:42,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 237 [2025-02-08 05:26:42,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 206 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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:26:42,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 237 [2025-02-08 05:26:42,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:44,291 INFO L124 PetriNetUnfolderBase]: 4201/16638 cut-off events. [2025-02-08 05:26:44,291 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-02-08 05:26:44,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23097 conditions, 16638 events. 4201/16638 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 207772 event pairs, 1667 based on Foata normal form. 0/14133 useless extension candidates. Maximal degree in co-relation 23056. Up to 4132 conditions per place. [2025-02-08 05:26:44,382 INFO L140 encePairwiseOnDemand]: 207/237 looper letters, 48 selfloop transitions, 21 changer transitions 0/235 dead transitions. [2025-02-08 05:26:44,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 235 transitions, 639 flow [2025-02-08 05:26:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-08 05:26:44,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8945147679324894 [2025-02-08 05:26:44,384 INFO L175 Difference]: Start difference. First operand has 209 places, 206 transitions, 433 flow. Second operand 3 states and 636 transitions. [2025-02-08 05:26:44,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 235 transitions, 639 flow [2025-02-08 05:26:44,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 235 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:44,387 INFO L231 Difference]: Finished difference. Result has 211 places, 227 transitions, 615 flow [2025-02-08 05:26:44,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=211, PETRI_TRANSITIONS=227} [2025-02-08 05:26:44,388 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -19 predicate places. [2025-02-08 05:26:44,388 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 227 transitions, 615 flow [2025-02-08 05:26:44,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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:26:44,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:44,389 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:44,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:26:44,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:26:44,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash -473639656, now seen corresponding path program 1 times [2025-02-08 05:26:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560553147] [2025-02-08 05:26:44,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:44,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:26:44,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:26:44,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:44,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:44,483 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:26:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:44,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560553147] [2025-02-08 05:26:44,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560553147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:44,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:44,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:26:44,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22305294] [2025-02-08 05:26:44,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:44,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:26:44,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:44,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:26:44,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:26:44,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 237 [2025-02-08 05:26:44,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 227 transitions, 615 flow. Second operand has 5 states, 5 states have (on average 205.6) internal successors, (1028), 5 states have internal predecessors, (1028), 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:26:44,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:44,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 237 [2025-02-08 05:26:44,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:45,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([717] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [227#true, 140#L1045true, 231#true, 241#(= |#race~len~0| 0), 229#true, Black: 247#(= |#race~next~0| 0), 250#true, 102#L1045true, 98#L1060-1true, 245#true, 197#thrENTRYtrue]) [2025-02-08 05:26:45,041 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-02-08 05:26:45,041 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-02-08 05:26:45,041 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-02-08 05:26:45,041 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-02-08 05:26:45,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([717] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [214#L1040true, 227#true, 140#L1045true, 231#true, 241#(= |#race~len~0| 0), 229#true, Black: 247#(= |#race~next~0| 0), 250#true, 102#L1045true, 98#L1060-1true, 245#true]) [2025-02-08 05:26:45,193 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-02-08 05:26:45,193 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-08 05:26:45,193 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:26:45,193 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-08 05:26:45,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([770] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][158], [183#L1043true, 227#true, 140#L1045true, 247#(= |#race~next~0| 0), 231#true, 241#(= |#race~len~0| 0), 229#true, 250#true, Black: 245#true, 98#L1060-1true, 58#L1045true]) [2025-02-08 05:26:45,412 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-02-08 05:26:45,412 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-08 05:26:45,412 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-08 05:26:45,412 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-02-08 05:26:45,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([823] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [227#true, 140#L1045true, 231#true, 241#(= |#race~len~0| 0), 229#true, 250#true, Black: 247#(= |#race~next~0| 0), 102#L1045true, 98#L1060-1true, 245#true, 58#L1045true]) [2025-02-08 05:26:45,429 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-02-08 05:26:45,429 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-02-08 05:26:45,429 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-02-08 05:26:45,429 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-02-08 05:26:45,513 INFO L124 PetriNetUnfolderBase]: 2174/11912 cut-off events. [2025-02-08 05:26:45,514 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-02-08 05:26:45,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16433 conditions, 11912 events. 2174/11912 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 151116 event pairs, 1056 based on Foata normal form. 1/10275 useless extension candidates. Maximal degree in co-relation 16391. Up to 2203 conditions per place. [2025-02-08 05:26:45,595 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 20 selfloop transitions, 0 changer transitions 4/230 dead transitions. [2025-02-08 05:26:45,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 230 transitions, 669 flow [2025-02-08 05:26:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:26:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:26:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1040 transitions. [2025-02-08 05:26:45,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776371308016878 [2025-02-08 05:26:45,598 INFO L175 Difference]: Start difference. First operand has 211 places, 227 transitions, 615 flow. Second operand 5 states and 1040 transitions. [2025-02-08 05:26:45,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 230 transitions, 669 flow [2025-02-08 05:26:45,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 230 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:45,622 INFO L231 Difference]: Finished difference. Result has 216 places, 226 transitions, 577 flow [2025-02-08 05:26:45,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=216, PETRI_TRANSITIONS=226} [2025-02-08 05:26:45,622 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -14 predicate places. [2025-02-08 05:26:45,622 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 226 transitions, 577 flow [2025-02-08 05:26:45,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 205.6) internal successors, (1028), 5 states have internal predecessors, (1028), 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:26:45,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:45,623 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:45,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:26:45,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-08 05:26:45,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1777168436, now seen corresponding path program 1 times [2025-02-08 05:26:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:45,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092143610] [2025-02-08 05:26:45,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:45,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:26:45,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:26:45,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:45,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:45,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:45,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:26:45,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:26:45,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:45,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:45,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:45,683 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:45,684 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-02-08 05:26:45,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-02-08 05:26:45,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-02-08 05:26:45,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-02-08 05:26:45,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-02-08 05:26:45,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-02-08 05:26:45,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-02-08 05:26:45,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-02-08 05:26:45,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-02-08 05:26:45,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-02-08 05:26:45,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:26:45,688 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:45,688 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:26:45,688 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:26:45,725 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:45,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 291 transitions, 610 flow [2025-02-08 05:26:45,760 INFO L124 PetriNetUnfolderBase]: 18/329 cut-off events. [2025-02-08 05:26:45,760 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:26:45,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 329 events. 18/329 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1100 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 273. Up to 5 conditions per place. [2025-02-08 05:26:45,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 291 transitions, 610 flow [2025-02-08 05:26:45,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 291 transitions, 610 flow [2025-02-08 05:26:45,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:45,768 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;@4d787a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:45,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-02-08 05:26:45,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:45,770 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:26:45,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:45,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:45,770 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] [2025-02-08 05:26:45,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:26:45,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash 25842437, now seen corresponding path program 1 times [2025-02-08 05:26:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:45,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155345625] [2025-02-08 05:26:45,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:45,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:26:45,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:26:45,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:45,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:45,787 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:26:45,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155345625] [2025-02-08 05:26:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155345625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:45,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:45,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631882211] [2025-02-08 05:26:45,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:45,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:45,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:45,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:45,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:45,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 291 [2025-02-08 05:26:45,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:26:45,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:45,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 291 [2025-02-08 05:26:45,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:48,237 INFO L124 PetriNetUnfolderBase]: 7737/27418 cut-off events. [2025-02-08 05:26:48,237 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-02-08 05:26:48,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38967 conditions, 27418 events. 7737/27418 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 355504 event pairs, 6804 based on Foata normal form. 5566/28317 useless extension candidates. Maximal degree in co-relation 31689. Up to 9608 conditions per place. [2025-02-08 05:26:48,506 INFO L140 encePairwiseOnDemand]: 278/291 looper letters, 31 selfloop transitions, 2 changer transitions 1/268 dead transitions. [2025-02-08 05:26:48,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 268 transitions, 630 flow [2025-02-08 05:26:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2025-02-08 05:26:48,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8820160366552119 [2025-02-08 05:26:48,509 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 610 flow. Second operand 3 states and 770 transitions. [2025-02-08 05:26:48,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 268 transitions, 630 flow [2025-02-08 05:26:48,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 268 transitions, 624 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:26:48,513 INFO L231 Difference]: Finished difference. Result has 270 places, 267 transitions, 560 flow [2025-02-08 05:26:48,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=268, 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=560, PETRI_PLACES=270, PETRI_TRANSITIONS=267} [2025-02-08 05:26:48,513 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-02-08 05:26:48,513 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 267 transitions, 560 flow [2025-02-08 05:26:48,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:26:48,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:48,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:48,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:26:48,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:26:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2141255963, now seen corresponding path program 1 times [2025-02-08 05:26:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456724902] [2025-02-08 05:26:48,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:48,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:26:48,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:26:48,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:48,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:48,529 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:26:48,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456724902] [2025-02-08 05:26:48,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456724902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:48,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:48,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:48,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961421627] [2025-02-08 05:26:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:48,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:48,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:48,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:48,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:48,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 291 [2025-02-08 05:26:48,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 267 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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:26:48,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:48,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 291 [2025-02-08 05:26:48,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:49,805 INFO L124 PetriNetUnfolderBase]: 2109/10364 cut-off events. [2025-02-08 05:26:49,805 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-02-08 05:26:49,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13348 conditions, 10364 events. 2109/10364 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 121763 event pairs, 1720 based on Foata normal form. 0/8419 useless extension candidates. Maximal degree in co-relation 13314. Up to 2507 conditions per place. [2025-02-08 05:26:49,947 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 26 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-02-08 05:26:49,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 266 transitions, 614 flow [2025-02-08 05:26:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2025-02-08 05:26:49,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8820160366552119 [2025-02-08 05:26:49,950 INFO L175 Difference]: Start difference. First operand has 270 places, 267 transitions, 560 flow. Second operand 3 states and 770 transitions. [2025-02-08 05:26:49,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 266 transitions, 614 flow [2025-02-08 05:26:49,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:49,958 INFO L231 Difference]: Finished difference. Result has 268 places, 266 transitions, 558 flow [2025-02-08 05:26:49,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=266, 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=558, PETRI_PLACES=268, PETRI_TRANSITIONS=266} [2025-02-08 05:26:49,958 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -14 predicate places. [2025-02-08 05:26:49,959 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 266 transitions, 558 flow [2025-02-08 05:26:49,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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:26:49,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:49,963 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] [2025-02-08 05:26:49,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:26:49,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:26:49,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1683381574, now seen corresponding path program 1 times [2025-02-08 05:26:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:49,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572298585] [2025-02-08 05:26:49,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:49,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:26:49,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:26:49,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:49,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:49,995 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:26:49,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:49,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572298585] [2025-02-08 05:26:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572298585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:49,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:49,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:49,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587885377] [2025-02-08 05:26:49,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:49,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:49,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:49,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:49,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:50,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 291 [2025-02-08 05:26:50,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 266 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:26:50,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:50,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 291 [2025-02-08 05:26:50,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:52,943 INFO L124 PetriNetUnfolderBase]: 7833/30189 cut-off events. [2025-02-08 05:26:52,944 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2025-02-08 05:26:53,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41008 conditions, 30189 events. 7833/30189 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 406587 event pairs, 6804 based on Foata normal form. 0/25680 useless extension candidates. Maximal degree in co-relation 40966. Up to 9610 conditions per place. [2025-02-08 05:26:53,311 INFO L140 encePairwiseOnDemand]: 279/291 looper letters, 34 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-02-08 05:26:53,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 255 transitions, 606 flow [2025-02-08 05:26:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-08 05:26:53,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8465063001145475 [2025-02-08 05:26:53,314 INFO L175 Difference]: Start difference. First operand has 268 places, 266 transitions, 558 flow. Second operand 3 states and 739 transitions. [2025-02-08 05:26:53,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 255 transitions, 606 flow [2025-02-08 05:26:53,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 255 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:53,318 INFO L231 Difference]: Finished difference. Result has 257 places, 255 transitions, 534 flow [2025-02-08 05:26:53,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=257, PETRI_TRANSITIONS=255} [2025-02-08 05:26:53,318 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -25 predicate places. [2025-02-08 05:26:53,319 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 255 transitions, 534 flow [2025-02-08 05:26:53,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:26:53,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:53,319 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] [2025-02-08 05:26:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:26:53,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:26:53,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash 76187131, now seen corresponding path program 1 times [2025-02-08 05:26:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53091607] [2025-02-08 05:26:53,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:53,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:26:53,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:26:53,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:53,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:53,338 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:26:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53091607] [2025-02-08 05:26:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53091607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:53,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:53,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621402548] [2025-02-08 05:26:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:53,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:53,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:53,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:53,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 291 [2025-02-08 05:26:53,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 255 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:26:53,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:53,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 291 [2025-02-08 05:26:53,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:53,540 INFO L124 PetriNetUnfolderBase]: 321/2744 cut-off events. [2025-02-08 05:26:53,541 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-02-08 05:26:53,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 2744 events. 321/2744 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 25807 event pairs, 204 based on Foata normal form. 0/2258 useless extension candidates. Maximal degree in co-relation 3158. Up to 328 conditions per place. [2025-02-08 05:26:53,567 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 15 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-02-08 05:26:53,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 254 transitions, 566 flow [2025-02-08 05:26:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2025-02-08 05:26:53,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9072164948453608 [2025-02-08 05:26:53,569 INFO L175 Difference]: Start difference. First operand has 257 places, 255 transitions, 534 flow. Second operand 3 states and 792 transitions. [2025-02-08 05:26:53,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 254 transitions, 566 flow [2025-02-08 05:26:53,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 254 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:53,572 INFO L231 Difference]: Finished difference. Result has 257 places, 254 transitions, 535 flow [2025-02-08 05:26:53,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=257, PETRI_TRANSITIONS=254} [2025-02-08 05:26:53,573 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -25 predicate places. [2025-02-08 05:26:53,573 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 254 transitions, 535 flow [2025-02-08 05:26:53,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:26:53,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:53,573 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] [2025-02-08 05:26:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:26:53,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:26:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1311802151, now seen corresponding path program 1 times [2025-02-08 05:26:53,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:53,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087659013] [2025-02-08 05:26:53,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:53,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:53,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:26:53,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:26:53,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:53,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:53,603 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:26:53,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087659013] [2025-02-08 05:26:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087659013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:53,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:53,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87483218] [2025-02-08 05:26:53,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:53,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:53,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:53,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:53,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 291 [2025-02-08 05:26:53,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 254 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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:26:53,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:53,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 291 [2025-02-08 05:26:53,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:16,226 INFO L124 PetriNetUnfolderBase]: 87933/257385 cut-off events. [2025-02-08 05:27:16,226 INFO L125 PetriNetUnfolderBase]: For 6739/6739 co-relation queries the response was YES. [2025-02-08 05:27:17,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378861 conditions, 257385 events. 87933/257385 cut-off events. For 6739/6739 co-relation queries the response was YES. Maximal size of possible extension queue 8419. Compared 4178561 event pairs, 36288 based on Foata normal form. 0/217765 useless extension candidates. Maximal degree in co-relation 378819. Up to 76888 conditions per place. [2025-02-08 05:27:18,730 INFO L140 encePairwiseOnDemand]: 251/291 looper letters, 64 selfloop transitions, 28 changer transitions 0/293 dead transitions. [2025-02-08 05:27:18,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 293 transitions, 812 flow [2025-02-08 05:27:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2025-02-08 05:27:18,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-02-08 05:27:18,735 INFO L175 Difference]: Start difference. First operand has 257 places, 254 transitions, 535 flow. Second operand 3 states and 776 transitions. [2025-02-08 05:27:18,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 293 transitions, 812 flow [2025-02-08 05:27:18,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 293 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:18,747 INFO L231 Difference]: Finished difference. Result has 259 places, 282 transitions, 779 flow [2025-02-08 05:27:18,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=259, PETRI_TRANSITIONS=282} [2025-02-08 05:27:18,751 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -23 predicate places. [2025-02-08 05:27:18,751 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 282 transitions, 779 flow [2025-02-08 05:27:18,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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:27:18,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:18,752 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:27:18,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:27:18,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-08 05:27:18,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:18,754 INFO L85 PathProgramCache]: Analyzing trace with hash 830704568, now seen corresponding path program 1 times [2025-02-08 05:27:18,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-02-08 05:27:18,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:18,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:27:18,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:27:18,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:18,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:19,060 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:27:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-02-08 05:27:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775391210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:19,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:27:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339903538] [2025-02-08 05:27:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:19,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:27:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:19,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:27:19,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:27:19,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 291 [2025-02-08 05:27:19,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 282 transitions, 779 flow. Second operand has 5 states, 5 states have (on average 248.4) internal successors, (1242), 5 states have internal predecessors, (1242), 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:27:19,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:19,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 291 [2025-02-08 05:27:19,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand