./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.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/goblint-regression/28-race_reach_20-callback_racefree.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 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:34:30,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:34:30,089 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:34:30,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:34:30,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:34:30,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:34:30,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:34:30,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:34:30,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:34:30,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:34:30,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:34:30,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:34:30,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:34:30,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:34:30,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:34:30,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:34:30,111 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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2025-02-08 05:34:30,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:34:30,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:34:30,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:34:30,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:34:30,334 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:34:30,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-02-08 05:34:31,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/500beed04/65cd15450ec541df8256ad195fed9572/FLAG232fe6465 [2025-02-08 05:34:31,830 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:34:31,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-02-08 05:34:31,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/500beed04/65cd15450ec541df8256ad195fed9572/FLAG232fe6465 [2025-02-08 05:34:31,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/500beed04/65cd15450ec541df8256ad195fed9572 [2025-02-08 05:34:31,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:34:31,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:34:31,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:34:31,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:34:31,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:34:31,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:34:31" (1/1) ... [2025-02-08 05:34:31,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139279b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:31, skipping insertion in model container [2025-02-08 05:34:31,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:34:31" (1/1) ... [2025-02-08 05:34:31,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:34:32,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:34:32,184 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:34:32,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:34:32,256 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:34:32,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32 WrapperNode [2025-02-08 05:34:32,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:34:32,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:34:32,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:34:32,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:34:32,262 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:34:32" (1/1) ... [2025-02-08 05:34:32,271 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:34:32" (1/1) ... [2025-02-08 05:34:32,290 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 209 [2025-02-08 05:34:32,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:34:32,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:34:32,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:34:32,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:34:32,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:34:32,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:34:32,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:34:32,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:34:32,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (1/1) ... [2025-02-08 05:34:32,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:34:32,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:34:32,346 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:34:32,351 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:34:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:34:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:34:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:34:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:34:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:34:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:34:32,369 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:34:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:34:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:34:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:34:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:34:32,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:34:32,371 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:34:32,482 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:34:32,484 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:34:32,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume { :end_inline_##fun~~TO~int } true;assume -2147483648 <= foo_#t~ret4#1 && foo_#t~ret4#1 <= 2147483647; [2025-02-08 05:34:32,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: havoc ##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset; [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-2: havoc ##fun~~TO~int_#t~ret52#1; [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: foo_#t~ret4#1 := ##fun~~TO~int_#res#1; [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: havoc ##fun~~TO~int_#t~ret52#1; [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-3: ##fun~~TO~int_#res#1 := ##fun~~TO~int_#t~ret52#1; [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume { :end_inline_bar } true;assume -2147483648 <= ##fun~~TO~int_#t~ret52#1 && ##fun~~TO~int_#t~ret52#1 <= 2147483647; [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-5: havoc bar_#t~ret6#1, bar_#t~ret7#1, bar_#t~post8#1, bar_#t~nondet9#1, bar_#t~ret10#1, bar_#t~ret11#1, bar_#t~post12#1, bar_#t~nondet13#1, bar_#t~ret14#1, bar_#t~ret15#1; [2025-02-08 05:34:32,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-6: ##fun~~TO~int_#t~ret52#1 := bar_#res#1; [2025-02-08 05:34:32,761 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:34:32,762 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:34:32,799 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:34:32,800 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:34:32,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:34:32 BoogieIcfgContainer [2025-02-08 05:34:32,800 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:34:32,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:34:32,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:34:32,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:34:32,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:34:31" (1/3) ... [2025-02-08 05:34:32,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574e2689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:34:32, skipping insertion in model container [2025-02-08 05:34:32,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:32" (2/3) ... [2025-02-08 05:34:32,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574e2689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:34:32, skipping insertion in model container [2025-02-08 05:34:32,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:34:32" (3/3) ... [2025-02-08 05:34:32,807 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2025-02-08 05:34:32,818 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:34:32,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_20-callback_racefree.i that has 2 procedures, 210 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2025-02-08 05:34:32,819 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:34:32,864 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:34:32,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 222 transitions, 451 flow [2025-02-08 05:34:33,020 INFO L124 PetriNetUnfolderBase]: 19/322 cut-off events. [2025-02-08 05:34:33,024 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:34:33,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 322 events. 19/322 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 888 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 182. Up to 6 conditions per place. [2025-02-08 05:34:33,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 222 transitions, 451 flow [2025-02-08 05:34:33,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 222 transitions, 451 flow [2025-02-08 05:34:33,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:33,050 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;@77230b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:33,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:34:33,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:33,071 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-08 05:34:33,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:33,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:33,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:33,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:34:33,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1737404471, now seen corresponding path program 1 times [2025-02-08 05:34:33,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:33,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468588152] [2025-02-08 05:34:33,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:33,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:34:33,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:34:33,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:33,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:33,826 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:34:33,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:33,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468588152] [2025-02-08 05:34:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468588152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533311259] [2025-02-08 05:34:33,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:33,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:33,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:33,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 222 [2025-02-08 05:34:33,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 222 transitions, 451 flow. Second operand has 6 states, 6 states have (on average 182.5) internal successors, (1095), 6 states have internal predecessors, (1095), 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:34:33,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:33,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 222 [2025-02-08 05:34:33,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:34,142 INFO L124 PetriNetUnfolderBase]: 87/766 cut-off events. [2025-02-08 05:34:34,143 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:34:34,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 766 events. 87/766 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4080 event pairs, 8 based on Foata normal form. 116/824 useless extension candidates. Maximal degree in co-relation 765. Up to 154 conditions per place. [2025-02-08 05:34:34,148 INFO L140 encePairwiseOnDemand]: 206/222 looper letters, 40 selfloop transitions, 5 changer transitions 0/225 dead transitions. [2025-02-08 05:34:34,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 225 transitions, 547 flow [2025-02-08 05:34:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1158 transitions. [2025-02-08 05:34:34,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693693693693694 [2025-02-08 05:34:34,166 INFO L175 Difference]: Start difference. First operand has 213 places, 222 transitions, 451 flow. Second operand 6 states and 1158 transitions. [2025-02-08 05:34:34,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 225 transitions, 547 flow [2025-02-08 05:34:34,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 225 transitions, 547 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:34,175 INFO L231 Difference]: Finished difference. Result has 215 places, 209 transitions, 435 flow [2025-02-08 05:34:34,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=215, PETRI_TRANSITIONS=209} [2025-02-08 05:34:34,179 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2025-02-08 05:34:34,180 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 209 transitions, 435 flow [2025-02-08 05:34:34,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.5) internal successors, (1095), 6 states have internal predecessors, (1095), 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:34:34,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:34,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:34,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:34:34,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:34:34,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1523909900, now seen corresponding path program 1 times [2025-02-08 05:34:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:34,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286590249] [2025-02-08 05:34:34,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:34,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:34:34,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:34:34,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:34,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:34,250 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:34:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:34,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286590249] [2025-02-08 05:34:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286590249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:34,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459685826] [2025-02-08 05:34:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:34,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:34,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:34,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 222 [2025-02-08 05:34:34,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 209 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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:34:34,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:34,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 222 [2025-02-08 05:34:34,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:34,370 INFO L124 PetriNetUnfolderBase]: 45/659 cut-off events. [2025-02-08 05:34:34,370 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:34:34,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 659 events. 45/659 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3128 event pairs, 0 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 660. Up to 94 conditions per place. [2025-02-08 05:34:34,373 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 20 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2025-02-08 05:34:34,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 213 transitions, 487 flow [2025-02-08 05:34:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2025-02-08 05:34:34,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9039039039039038 [2025-02-08 05:34:34,375 INFO L175 Difference]: Start difference. First operand has 215 places, 209 transitions, 435 flow. Second operand 3 states and 602 transitions. [2025-02-08 05:34:34,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 213 transitions, 487 flow [2025-02-08 05:34:34,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 213 transitions, 477 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:34,379 INFO L231 Difference]: Finished difference. Result has 213 places, 209 transitions, 433 flow [2025-02-08 05:34:34,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=213, PETRI_TRANSITIONS=209} [2025-02-08 05:34:34,380 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 0 predicate places. [2025-02-08 05:34:34,380 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 209 transitions, 433 flow [2025-02-08 05:34:34,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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:34:34,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:34,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:34,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:34:34,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:34:34,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1879747297, now seen corresponding path program 1 times [2025-02-08 05:34:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:34,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689204249] [2025-02-08 05:34:34,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:34,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:34:34,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:34:34,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:34,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:34,436 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:34:34,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:34,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689204249] [2025-02-08 05:34:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689204249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:34,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:34,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:34,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137923029] [2025-02-08 05:34:34,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:34,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:34,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:34,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:34,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 222 [2025-02-08 05:34:34,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 209 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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:34:34,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:34,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 222 [2025-02-08 05:34:34,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:34,540 INFO L124 PetriNetUnfolderBase]: 92/670 cut-off events. [2025-02-08 05:34:34,541 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2025-02-08 05:34:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 670 events. 92/670 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3217 event pairs, 32 based on Foata normal form. 1/621 useless extension candidates. Maximal degree in co-relation 791. Up to 125 conditions per place. [2025-02-08 05:34:34,544 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 27 selfloop transitions, 6 changer transitions 10/221 dead transitions. [2025-02-08 05:34:34,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 221 transitions, 527 flow [2025-02-08 05:34:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2025-02-08 05:34:34,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9039039039039038 [2025-02-08 05:34:34,547 INFO L175 Difference]: Start difference. First operand has 213 places, 209 transitions, 433 flow. Second operand 3 states and 602 transitions. [2025-02-08 05:34:34,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 221 transitions, 527 flow [2025-02-08 05:34:34,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 221 transitions, 523 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:34,551 INFO L231 Difference]: Finished difference. Result has 213 places, 203 transitions, 451 flow [2025-02-08 05:34:34,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=213, PETRI_TRANSITIONS=203} [2025-02-08 05:34:34,553 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 0 predicate places. [2025-02-08 05:34:34,553 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 203 transitions, 451 flow [2025-02-08 05:34:34,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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:34:34,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:34,554 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:34,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:34:34,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:34:34,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -429449588, now seen corresponding path program 1 times [2025-02-08 05:34:34,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:34,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448567584] [2025-02-08 05:34:34,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:34,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:34,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:34:34,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:34:34,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:34,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:34,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:34:34,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:34:34,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:34:34,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:34,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:34,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:34:34,636 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:34:34,637 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 05:34:34,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-08 05:34:34,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-08 05:34:34,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-08 05:34:34,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-08 05:34:34,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-08 05:34:34,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-08 05:34:34,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-08 05:34:34,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-08 05:34:34,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:34:34,639 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:34:34,642 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:34:34,642 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:34:34,664 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:34:34,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 255 transitions, 526 flow [2025-02-08 05:34:34,722 INFO L124 PetriNetUnfolderBase]: 32/482 cut-off events. [2025-02-08 05:34:34,722 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:34:34,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 482 events. 32/482 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1699 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 324. Up to 9 conditions per place. [2025-02-08 05:34:34,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 255 transitions, 526 flow [2025-02-08 05:34:34,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 255 transitions, 526 flow [2025-02-08 05:34:34,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:34,727 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;@77230b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:34,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 05:34:34,733 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:34,733 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-08 05:34:34,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:34,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:34,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:34,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2017508745, now seen corresponding path program 1 times [2025-02-08 05:34:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298775123] [2025-02-08 05:34:34,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:34,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:34:34,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:34:34,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:34,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:35,075 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:34:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298775123] [2025-02-08 05:34:35,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298775123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:35,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:35,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6250364] [2025-02-08 05:34:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:35,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:35,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:35,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:35,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 255 [2025-02-08 05:34:35,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 255 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:34:35,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:35,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 255 [2025-02-08 05:34:35,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:35,719 INFO L124 PetriNetUnfolderBase]: 970/4455 cut-off events. [2025-02-08 05:34:35,720 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-08 05:34:35,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6114 conditions, 4455 events. 970/4455 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 41622 event pairs, 80 based on Foata normal form. 1112/5237 useless extension candidates. Maximal degree in co-relation 2007. Up to 1202 conditions per place. [2025-02-08 05:34:35,746 INFO L140 encePairwiseOnDemand]: 235/255 looper letters, 62 selfloop transitions, 5 changer transitions 0/268 dead transitions. [2025-02-08 05:34:35,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 268 transitions, 686 flow [2025-02-08 05:34:35,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1332 transitions. [2025-02-08 05:34:35,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8705882352941177 [2025-02-08 05:34:35,750 INFO L175 Difference]: Start difference. First operand has 243 places, 255 transitions, 526 flow. Second operand 6 states and 1332 transitions. [2025-02-08 05:34:35,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 268 transitions, 686 flow [2025-02-08 05:34:35,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 268 transitions, 686 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:35,756 INFO L231 Difference]: Finished difference. Result has 243 places, 236 transitions, 498 flow [2025-02-08 05:34:35,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=243, PETRI_TRANSITIONS=236} [2025-02-08 05:34:35,758 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 0 predicate places. [2025-02-08 05:34:35,758 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 236 transitions, 498 flow [2025-02-08 05:34:35,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:34:35,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:35,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:35,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:34:35,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:35,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1710555980, now seen corresponding path program 1 times [2025-02-08 05:34:35,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:35,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986934271] [2025-02-08 05:34:35,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:35,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:34:35,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:34:35,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:35,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:35,831 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:34:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986934271] [2025-02-08 05:34:35,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986934271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:35,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:35,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:35,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485307148] [2025-02-08 05:34:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:35,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:35,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:35,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:35,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 255 [2025-02-08 05:34:35,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 236 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:34:35,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:35,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 255 [2025-02-08 05:34:35,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:36,181 INFO L124 PetriNetUnfolderBase]: 488/2990 cut-off events. [2025-02-08 05:34:36,181 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-08 05:34:36,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 2990 events. 488/2990 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 25763 event pairs, 208 based on Foata normal form. 1/2729 useless extension candidates. Maximal degree in co-relation 785. Up to 817 conditions per place. [2025-02-08 05:34:36,196 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 27 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2025-02-08 05:34:36,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 241 transitions, 568 flow [2025-02-08 05:34:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2025-02-08 05:34:36,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2025-02-08 05:34:36,198 INFO L175 Difference]: Start difference. First operand has 243 places, 236 transitions, 498 flow. Second operand 3 states and 675 transitions. [2025-02-08 05:34:36,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 241 transitions, 568 flow [2025-02-08 05:34:36,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 241 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:36,202 INFO L231 Difference]: Finished difference. Result has 241 places, 237 transitions, 500 flow [2025-02-08 05:34:36,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=241, PETRI_TRANSITIONS=237} [2025-02-08 05:34:36,203 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -2 predicate places. [2025-02-08 05:34:36,203 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 237 transitions, 500 flow [2025-02-08 05:34:36,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:34:36,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:36,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:36,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:34:36,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:36,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 192172863, now seen corresponding path program 1 times [2025-02-08 05:34:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:36,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478431604] [2025-02-08 05:34:36,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:36,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:34:36,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:34:36,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:36,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:36,256 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:34:36,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:36,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478431604] [2025-02-08 05:34:36,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478431604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:36,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:36,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:36,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309618367] [2025-02-08 05:34:36,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:36,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:36,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:36,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:36,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:36,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 255 [2025-02-08 05:34:36,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 237 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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:34:36,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:36,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 255 [2025-02-08 05:34:36,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:36,865 INFO L124 PetriNetUnfolderBase]: 1719/6281 cut-off events. [2025-02-08 05:34:36,865 INFO L125 PetriNetUnfolderBase]: For 76/151 co-relation queries the response was YES. [2025-02-08 05:34:36,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9234 conditions, 6281 events. 1719/6281 cut-off events. For 76/151 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 61412 event pairs, 743 based on Foata normal form. 1/5733 useless extension candidates. Maximal degree in co-relation 9127. Up to 1903 conditions per place. [2025-02-08 05:34:36,890 INFO L140 encePairwiseOnDemand]: 243/255 looper letters, 43 selfloop transitions, 8 changer transitions 0/256 dead transitions. [2025-02-08 05:34:36,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 256 transitions, 645 flow [2025-02-08 05:34:36,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2025-02-08 05:34:36,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8836601307189542 [2025-02-08 05:34:36,892 INFO L175 Difference]: Start difference. First operand has 241 places, 237 transitions, 500 flow. Second operand 3 states and 676 transitions. [2025-02-08 05:34:36,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 256 transitions, 645 flow [2025-02-08 05:34:36,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 256 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:34:36,897 INFO L231 Difference]: Finished difference. Result has 242 places, 241 transitions, 554 flow [2025-02-08 05:34:36,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=242, PETRI_TRANSITIONS=241} [2025-02-08 05:34:36,898 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -1 predicate places. [2025-02-08 05:34:36,898 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 241 transitions, 554 flow [2025-02-08 05:34:36,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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:34:36,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:36,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:36,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:34:36,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:36,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash 222674882, now seen corresponding path program 1 times [2025-02-08 05:34:36,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:36,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920909014] [2025-02-08 05:34:36,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:36,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:36,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:34:36,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:34:36,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:36,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:36,982 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:34:36,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:36,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920909014] [2025-02-08 05:34:36,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920909014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:36,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:36,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:36,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921956617] [2025-02-08 05:34:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:36,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:34:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:36,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:34:36,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:34:37,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 255 [2025-02-08 05:34:37,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 241 transitions, 554 flow. Second operand has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 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:34:37,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:37,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 255 [2025-02-08 05:34:37,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:37,650 INFO L124 PetriNetUnfolderBase]: 1071/6226 cut-off events. [2025-02-08 05:34:37,651 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2025-02-08 05:34:37,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8598 conditions, 6226 events. 1071/6226 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 64295 event pairs, 205 based on Foata normal form. 5/5734 useless extension candidates. Maximal degree in co-relation 5880. Up to 1366 conditions per place. [2025-02-08 05:34:37,674 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 44 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2025-02-08 05:34:37,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 263 transitions, 696 flow [2025-02-08 05:34:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1328 transitions. [2025-02-08 05:34:37,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679738562091504 [2025-02-08 05:34:37,677 INFO L175 Difference]: Start difference. First operand has 242 places, 241 transitions, 554 flow. Second operand 6 states and 1328 transitions. [2025-02-08 05:34:37,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 263 transitions, 696 flow [2025-02-08 05:34:37,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 263 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:37,683 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 564 flow [2025-02-08 05:34:37,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=564, PETRI_PLACES=248, PETRI_TRANSITIONS=243} [2025-02-08 05:34:37,684 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 5 predicate places. [2025-02-08 05:34:37,684 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 564 flow [2025-02-08 05:34:37,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 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:34:37,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:37,685 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:37,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:34:37,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1191101540, now seen corresponding path program 1 times [2025-02-08 05:34:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216570504] [2025-02-08 05:34:37,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:37,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:34:37,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:34:37,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:37,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:37,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:34:37,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:34:37,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:34:37,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:37,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:37,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:34:37,756 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-08 05:34:37,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-08 05:34:37,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-08 05:34:37,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:34:37,757 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:34:37,759 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:34:37,759 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:34:37,782 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:34:37,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 288 transitions, 603 flow [2025-02-08 05:34:37,852 INFO L124 PetriNetUnfolderBase]: 48/685 cut-off events. [2025-02-08 05:34:37,852 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:34:37,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 685 events. 48/685 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2789 event pairs, 1 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 490. Up to 12 conditions per place. [2025-02-08 05:34:37,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 273 places, 288 transitions, 603 flow [2025-02-08 05:34:37,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 288 transitions, 603 flow [2025-02-08 05:34:37,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:37,866 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;@77230b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:37,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 05:34:37,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:37,872 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-08 05:34:37,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:37,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:37,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:37,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:37,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash 613595767, now seen corresponding path program 1 times [2025-02-08 05:34:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:37,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081276170] [2025-02-08 05:34:37,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:37,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:37,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:34:37,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:34:37,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:37,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:38,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:38,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081276170] [2025-02-08 05:34:38,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081276170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:38,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:38,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847153449] [2025-02-08 05:34:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:38,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:38,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:38,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:38,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 288 [2025-02-08 05:34:38,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 288 transitions, 603 flow. Second operand has 6 states, 6 states have (on average 226.5) internal successors, (1359), 6 states have internal predecessors, (1359), 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:34:38,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:38,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 288 [2025-02-08 05:34:38,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:40,609 INFO L124 PetriNetUnfolderBase]: 7964/26108 cut-off events. [2025-02-08 05:34:40,609 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-02-08 05:34:40,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37843 conditions, 26108 events. 7964/26108 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 314743 event pairs, 773 based on Foata normal form. 8575/32871 useless extension candidates. Maximal degree in co-relation 6144. Up to 8631 conditions per place. [2025-02-08 05:34:40,766 INFO L140 encePairwiseOnDemand]: 264/288 looper letters, 84 selfloop transitions, 5 changer transitions 0/311 dead transitions. [2025-02-08 05:34:40,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 311 transitions, 827 flow [2025-02-08 05:34:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1506 transitions. [2025-02-08 05:34:40,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8715277777777778 [2025-02-08 05:34:40,772 INFO L175 Difference]: Start difference. First operand has 273 places, 288 transitions, 603 flow. Second operand 6 states and 1506 transitions. [2025-02-08 05:34:40,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 311 transitions, 827 flow [2025-02-08 05:34:40,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 311 transitions, 827 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:40,778 INFO L231 Difference]: Finished difference. Result has 271 places, 263 transitions, 563 flow [2025-02-08 05:34:40,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=563, PETRI_PLACES=271, PETRI_TRANSITIONS=263} [2025-02-08 05:34:40,781 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -2 predicate places. [2025-02-08 05:34:40,781 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 263 transitions, 563 flow [2025-02-08 05:34:40,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.5) internal successors, (1359), 6 states have internal predecessors, (1359), 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:34:40,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:40,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:40,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:34:40,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:40,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 605095092, now seen corresponding path program 1 times [2025-02-08 05:34:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771378821] [2025-02-08 05:34:40,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:40,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:40,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:34:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:34:40,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:40,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:40,834 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:34:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771378821] [2025-02-08 05:34:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771378821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666727145] [2025-02-08 05:34:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:40,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 288 [2025-02-08 05:34:40,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 263 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:34:40,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:40,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 288 [2025-02-08 05:34:40,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:42,318 INFO L124 PetriNetUnfolderBase]: 3944/15861 cut-off events. [2025-02-08 05:34:42,319 INFO L125 PetriNetUnfolderBase]: For 684/684 co-relation queries the response was YES. [2025-02-08 05:34:42,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22079 conditions, 15861 events. 3944/15861 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 187224 event pairs, 3526 based on Foata normal form. 1/14353 useless extension candidates. Maximal degree in co-relation 13967. Up to 5788 conditions per place. [2025-02-08 05:34:42,404 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 33 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-08 05:34:42,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 268 transitions, 645 flow [2025-02-08 05:34:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-02-08 05:34:42,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8645833333333334 [2025-02-08 05:34:42,406 INFO L175 Difference]: Start difference. First operand has 271 places, 263 transitions, 563 flow. Second operand 3 states and 747 transitions. [2025-02-08 05:34:42,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 268 transitions, 645 flow [2025-02-08 05:34:42,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 268 transitions, 633 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:42,410 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 565 flow [2025-02-08 05:34:42,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-02-08 05:34:42,411 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -4 predicate places. [2025-02-08 05:34:42,412 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 565 flow [2025-02-08 05:34:42,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:34:42,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:42,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:42,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:34:42,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:42,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash 471284862, now seen corresponding path program 1 times [2025-02-08 05:34:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-02-08 05:34:42,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:42,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:34:42,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:34:42,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:42,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:42,444 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:34:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:42,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-02-08 05:34:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532172894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849792046] [2025-02-08 05:34:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:42,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:42,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:42,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 288 [2025-02-08 05:34:42,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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:34:42,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:42,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 288 [2025-02-08 05:34:42,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:47,680 INFO L124 PetriNetUnfolderBase]: 21934/57939 cut-off events. [2025-02-08 05:34:47,680 INFO L125 PetriNetUnfolderBase]: For 1125/1687 co-relation queries the response was YES. [2025-02-08 05:34:47,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90151 conditions, 57939 events. 21934/57939 cut-off events. For 1125/1687 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 733730 event pairs, 9828 based on Foata normal form. 0/52986 useless extension candidates. Maximal degree in co-relation 90043. Up to 21877 conditions per place. [2025-02-08 05:34:47,951 INFO L140 encePairwiseOnDemand]: 273/288 looper letters, 57 selfloop transitions, 10 changer transitions 0/290 dead transitions. [2025-02-08 05:34:47,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 290 transitions, 763 flow [2025-02-08 05:34:47,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2025-02-08 05:34:47,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2025-02-08 05:34:47,953 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 565 flow. Second operand 3 states and 750 transitions. [2025-02-08 05:34:47,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 290 transitions, 763 flow [2025-02-08 05:34:47,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:34:47,957 INFO L231 Difference]: Finished difference. Result has 270 places, 270 transitions, 637 flow [2025-02-08 05:34:47,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=270, PETRI_TRANSITIONS=270} [2025-02-08 05:34:47,957 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -3 predicate places. [2025-02-08 05:34:47,958 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 270 transitions, 637 flow [2025-02-08 05:34:47,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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:34:47,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:47,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:47,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:34:47,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:47,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1277385987, now seen corresponding path program 1 times [2025-02-08 05:34:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348439255] [2025-02-08 05:34:47,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:47,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:34:47,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:34:47,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:47,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:48,034 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:34:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348439255] [2025-02-08 05:34:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348439255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969483769] [2025-02-08 05:34:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:48,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:34:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:48,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:34:48,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:34:48,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 288 [2025-02-08 05:34:48,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 270 transitions, 637 flow. Second operand has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 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:34:48,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:48,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 288 [2025-02-08 05:34:48,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:53,142 INFO L124 PetriNetUnfolderBase]: 12951/53142 cut-off events. [2025-02-08 05:34:53,143 INFO L125 PetriNetUnfolderBase]: For 2976/2988 co-relation queries the response was YES. [2025-02-08 05:34:53,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77031 conditions, 53142 events. 12951/53142 cut-off events. For 2976/2988 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 762560 event pairs, 7186 based on Foata normal form. 5/48287 useless extension candidates. Maximal degree in co-relation 27850. Up to 15566 conditions per place. [2025-02-08 05:34:53,449 INFO L140 encePairwiseOnDemand]: 283/288 looper letters, 52 selfloop transitions, 5 changer transitions 0/294 dead transitions. [2025-02-08 05:34:53,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 294 transitions, 801 flow [2025-02-08 05:34:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1468 transitions. [2025-02-08 05:34:53,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8495370370370371 [2025-02-08 05:34:53,452 INFO L175 Difference]: Start difference. First operand has 270 places, 270 transitions, 637 flow. Second operand 6 states and 1468 transitions. [2025-02-08 05:34:53,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 294 transitions, 801 flow [2025-02-08 05:34:53,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 294 transitions, 781 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:53,481 INFO L231 Difference]: Finished difference. Result has 276 places, 273 transitions, 649 flow [2025-02-08 05:34:53,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=276, PETRI_TRANSITIONS=273} [2025-02-08 05:34:53,482 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, 3 predicate places. [2025-02-08 05:34:53,482 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 273 transitions, 649 flow [2025-02-08 05:34:53,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 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:34:53,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:53,483 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:53,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:34:53,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:53,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1703462479, now seen corresponding path program 1 times [2025-02-08 05:34:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:53,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479085833] [2025-02-08 05:34:53,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:53,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:34:53,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:34:53,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:53,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:53,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:34:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:53,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479085833] [2025-02-08 05:34:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479085833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347111961] [2025-02-08 05:34:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:53,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:53,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:53,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 288 [2025-02-08 05:34:53,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 273 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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:34:53,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:53,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 288 [2025-02-08 05:34:53,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:01,803 INFO L124 PetriNetUnfolderBase]: 21470/84440 cut-off events. [2025-02-08 05:35:01,804 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2025-02-08 05:35:02,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120256 conditions, 84440 events. 21470/84440 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 2203. Compared 1296984 event pairs, 12307 based on Foata normal form. 242/76377 useless extension candidates. Maximal degree in co-relation 120068. Up to 14319 conditions per place. [2025-02-08 05:35:02,306 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 47 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-02-08 05:35:02,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 292 transitions, 785 flow [2025-02-08 05:35:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-02-08 05:35:02,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8807870370370371 [2025-02-08 05:35:02,307 INFO L175 Difference]: Start difference. First operand has 276 places, 273 transitions, 649 flow. Second operand 3 states and 761 transitions. [2025-02-08 05:35:02,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 292 transitions, 785 flow [2025-02-08 05:35:02,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 292 transitions, 779 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 05:35:02,312 INFO L231 Difference]: Finished difference. Result has 277 places, 274 transitions, 655 flow [2025-02-08 05:35:02,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=277, PETRI_TRANSITIONS=274} [2025-02-08 05:35:02,313 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, 4 predicate places. [2025-02-08 05:35:02,313 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 274 transitions, 655 flow [2025-02-08 05:35:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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:35:02,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:02,314 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:35:02,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:35:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1180951596, now seen corresponding path program 1 times [2025-02-08 05:35:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:02,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288594647] [2025-02-08 05:35:02,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:02,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 05:35:02,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 05:35:02,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:02,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:02,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:35:02,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 05:35:02,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 05:35:02,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:02,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:02,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:35:02,359 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:35:02,359 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-08 05:35:02,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-08 05:35:02,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:35:02,361 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:35:02,361 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:35:02,361 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:35:02,380 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:35:02,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 321 transitions, 682 flow [2025-02-08 05:35:02,449 INFO L124 PetriNetUnfolderBase]: 72/976 cut-off events. [2025-02-08 05:35:02,450 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 05:35:02,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 976 events. 72/976 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4367 event pairs, 6 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 705. Up to 32 conditions per place. [2025-02-08 05:35:02,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 303 places, 321 transitions, 682 flow [2025-02-08 05:35:02,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 303 places, 321 transitions, 682 flow [2025-02-08 05:35:02,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:35:02,460 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;@77230b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:35:02,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:35:02,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:35:02,466 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-08 05:35:02,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:35:02,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:02,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:02,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:35:02,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:02,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1040783415, now seen corresponding path program 1 times [2025-02-08 05:35:02,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:02,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714064740] [2025-02-08 05:35:02,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:02,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:35:02,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:35:02,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:02,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:02,811 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:35:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714064740] [2025-02-08 05:35:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714064740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:02,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555228730] [2025-02-08 05:35:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:02,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:02,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:02,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:02,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 321 [2025-02-08 05:35:02,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 321 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 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:35:02,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:02,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 321 [2025-02-08 05:35:02,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand