./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 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_91-arrayloop2_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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 05:36:27,341 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 05:36:27,399 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:36:27,408 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 05:36:27,409 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 05:36:27,422 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 05:36:27,422 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 05:36:27,422 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 05:36:27,423 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-08 05:36:27,423 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 05:36:27,423 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-08 05:36:27,423 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 05:36:27,424 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 05:36:27,424 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-08 05:36:27,424 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-08 05:36:27,425 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-08 05:36:27,425 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-08 05:36:27,425 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3
[2025-02-08 05:36:27,651 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 05:36:27,657 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 05:36:27,659 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 05:36:27,660 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 05:36:27,660 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 05:36:27,661 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_91-arrayloop2_racefree.i
[2025-02-08 05:36:28,898 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a552951/baff698a553143039c0a586836653112/FLAG3830e64dd
[2025-02-08 05:36:29,204 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 05:36:29,206 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i
[2025-02-08 05:36:29,229 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a552951/baff698a553143039c0a586836653112/FLAG3830e64dd
[2025-02-08 05:36:29,494 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a552951/baff698a553143039c0a586836653112
[2025-02-08 05:36:29,495 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 05:36:29,496 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 05:36:29,497 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 05:36:29,497 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 05:36:29,501 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 05:36:29,501 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,503 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f4240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29, skipping insertion in model container
[2025-02-08 05:36:29,503 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,538 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 05:36:29,777 WARN  L1731              CHandler]: Possible shadowing of function new
[2025-02-08 05:36:29,777 WARN  L1731              CHandler]: Possible shadowing of function new
[2025-02-08 05:36:29,778 WARN  L1731              CHandler]: Possible shadowing of function new
[2025-02-08 05:36:29,778 WARN  L1731              CHandler]: Possible shadowing of function new
[2025-02-08 05:36:29,795 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 05:36:29,823 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 05:36:29,850 WARN  L1731              CHandler]: Possible shadowing of function new
[2025-02-08 05:36:29,850 WARN  L1731              CHandler]: Possible shadowing of function new
[2025-02-08 05:36:29,851 WARN  L1731              CHandler]: Possible shadowing of function new
[2025-02-08 05:36:29,852 WARN  L1731              CHandler]: Possible shadowing of function new
[2025-02-08 05:36:29,860 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 05:36:29,900 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 05:36:29,901 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29 WrapperNode
[2025-02-08 05:36:29,902 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 05:36:29,903 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 05:36:29,903 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 05:36:29,903 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 05:36:29,910 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:36:29" (1/1) ...
[2025-02-08 05:36:29,922 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:36:29" (1/1) ...
[2025-02-08 05:36:29,953 INFO  L138                Inliner]: procedures = 279, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 360
[2025-02-08 05:36:29,953 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 05:36:29,954 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 05:36:29,954 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 05:36:29,954 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 05:36:29,959 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,960 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,964 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,964 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,978 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,979 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,981 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,982 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,984 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 05:36:29,985 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 05:36:29,985 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 05:36:29,985 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 05:36:29,986 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (1/1) ...
[2025-02-08 05:36:29,989 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 05:36:30,003 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 05:36:30,025 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:36:30,033 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:36:30,050 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure t_fun
[2025-02-08 05:36:30,051 INFO  L138     BoogieDeclarations]: Found implementation of procedure t_fun
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-02-08 05:36:30,051 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 05:36:30,051 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 05:36:30,052 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:36:30,173 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 05:36:30,174 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 05:36:30,629 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-2: main_~j~1#1 := 1 + main_#t~post33#1;
[2025-02-08 05:36:30,629 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-3: assume { :end_inline_list_add } true;main_#t~post33#1 := main_~j~1#1;
[2025-02-08 05:36:30,629 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-4: havoc list_add_#in~new#1.base, list_add_#in~new#1.offset, list_add_#in~head#1.base, list_add_#in~head#1.offset;
[2025-02-08 05:36:30,629 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-5: havoc list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset, list_add_#t~nondet8#1, list_add_#t~nondet9#1, list_add_#t~nondet10#1, list_add_#t~nondet11#1, list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, list_add_~next~0#1.base, list_add_~next~0#1.offset;
[2025-02-08 05:36:30,629 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-6: havoc list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset, list_add_#t~nondet8#1, list_add_#t~nondet9#1, list_add_#t~nondet10#1, list_add_#t~nondet11#1, list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, list_add_~next~0#1.base, list_add_~next~0#1.offset;
[2025-02-08 05:36:30,629 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-7: assume { :end_inline_new } true;assume { :begin_inline_list_add } true;list_add_#in~new#1.base, list_add_#in~new#1.offset, list_add_#in~head#1.base, list_add_#in~head#1.offset := main_#t~ret32#1.base, 4 + main_#t~ret32#1.offset, ~#c~0.base, ~#c~0.offset + 8 * main_~i~0#1;
[2025-02-08 05:36:30,630 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-8: havoc new_#in~x#1;
[2025-02-08 05:36:30,630 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-9: havoc new_#t~malloc5#1.base, new_#t~malloc5#1.offset, new_#t~nondet6#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset;
[2025-02-08 05:36:30,630 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-10: main_#t~ret32#1.base, main_#t~ret32#1.offset := new_#res#1.base, new_#res#1.offset;
[2025-02-08 05:36:30,630 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1061: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset;
[2025-02-08 05:36:30,630 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null
[2025-02-08 05:36:30,630 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1028: list_add_~head#1.base, list_add_~head#1.offset := list_add_#in~head#1.base, list_add_#in~head#1.offset;
[2025-02-08 05:36:30,630 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1028-1: list_add_~new#1.base, list_add_~new#1.offset := list_add_#in~new#1.base, list_add_#in~new#1.offset;
[2025-02-08 05:36:30,630 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029: havoc list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset;
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-1: assume ((0 == #race[list_add_~head#1.base,list_add_~head#1.offset] && 0 == #race[list_add_~head#1.base,1 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,2 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,3 + list_add_~head#1.offset];
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-1: assume !(((0 == #race[list_add_~head#1.base,list_add_~head#1.offset] && 0 == #race[list_add_~head#1.base,1 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,2 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,3 + list_add_~head#1.offset]);
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-2: list_add_~next~0#1.base, list_add_~next~0#1.offset := list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset;
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-3: #race := #race[list_add_~head#1.base,3 + list_add_~head#1.offset := 0];
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-4: #race := #race[list_add_~head#1.base,2 + list_add_~head#1.offset := 0];
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-5: #race := #race[list_add_~head#1.base,1 + list_add_~head#1.offset := 0];
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-6: #race := #race[list_add_~head#1.base,list_add_~head#1.offset := 0];
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-7: SUMMARY for call list_add_#t~mem7#1.base, list_add_#t~mem7#1.offset := read~$Pointer$(list_add_~head#1.base, list_add_~head#1.offset, 4); srcloc: null
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030: assume ((#race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1 && #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1;
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030: assume !(((#race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1 && #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset] == list_add_#t~nondet8#1);
[2025-02-08 05:36:30,631 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-1: havoc list_add_#t~nondet8#1;
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-2: #race := #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset := list_add_#t~nondet8#1];
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-3: #race := #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset := list_add_#t~nondet8#1];
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-4: #race := #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset := list_add_#t~nondet8#1];
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-5: #race := #race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset := list_add_#t~nondet8#1];
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-6: havoc list_add_#t~nondet8#1;
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-7: SUMMARY for call write~$Pointer$(list_add_~new#1.base, list_add_~new#1.offset, list_add_~next~0#1.base, 4 + list_add_~next~0#1.offset, 4); srcloc: null
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031: assume ((#race[list_add_~new#1.base,list_add_~new#1.offset] == list_add_#t~nondet9#1 && #race[list_add_~new#1.base,1 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,2 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,3 + list_add_~new#1.offset] == list_add_#t~nondet9#1;
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031: assume !(((#race[list_add_~new#1.base,list_add_~new#1.offset] == list_add_#t~nondet9#1 && #race[list_add_~new#1.base,1 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,2 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,3 + list_add_~new#1.offset] == list_add_#t~nondet9#1);
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-1: havoc list_add_#t~nondet9#1;
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-2: #race := #race[list_add_~new#1.base,3 + list_add_~new#1.offset := list_add_#t~nondet9#1];
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-3: #race := #race[list_add_~new#1.base,2 + list_add_~new#1.offset := list_add_#t~nondet9#1];
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-4: #race := #race[list_add_~new#1.base,1 + list_add_~new#1.offset := list_add_#t~nondet9#1];
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-5: #race := #race[list_add_~new#1.base,list_add_~new#1.offset := list_add_#t~nondet9#1];
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-6: havoc list_add_#t~nondet9#1;
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-7: SUMMARY for call write~$Pointer$(list_add_~next~0#1.base, list_add_~next~0#1.offset, list_add_~new#1.base, list_add_~new#1.offset, 4); srcloc: null
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032: assume ((#race[list_add_~new#1.base,4 + list_add_~new#1.offset] == list_add_#t~nondet10#1 && #race[list_add_~new#1.base,5 + list_add_~new#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~new#1.base,6 + list_add_~new#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~new#1.base,7 + list_add_~new#1.offset] == list_add_#t~nondet10#1;
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032: assume !(((#race[list_add_~new#1.base,4 + list_add_~new#1.offset] == list_add_#t~nondet10#1 && #race[list_add_~new#1.base,5 + list_add_~new#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~new#1.base,6 + list_add_~new#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~new#1.base,7 + list_add_~new#1.offset] == list_add_#t~nondet10#1);
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-1: havoc list_add_#t~nondet10#1;
[2025-02-08 05:36:30,632 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: #race := #race[list_add_~new#1.base,7 + list_add_~new#1.offset := list_add_#t~nondet10#1];
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-3: #race := #race[list_add_~new#1.base,6 + list_add_~new#1.offset := list_add_#t~nondet10#1];
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-4: #race := #race[list_add_~new#1.base,5 + list_add_~new#1.offset := list_add_#t~nondet10#1];
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-5: #race := #race[list_add_~new#1.base,4 + list_add_~new#1.offset := list_add_#t~nondet10#1];
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-6: havoc list_add_#t~nondet10#1;
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-7: SUMMARY for call write~$Pointer$(list_add_~head#1.base, list_add_~head#1.offset, list_add_~new#1.base, 4 + list_add_~new#1.offset, 4); srcloc: null
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033: assume ((#race[list_add_~head#1.base,list_add_~head#1.offset] == list_add_#t~nondet11#1 && #race[list_add_~head#1.base,1 + list_add_~head#1.offset] == list_add_#t~nondet11#1) && #race[list_add_~head#1.base,2 + list_add_~head#1.offset] == list_add_#t~nondet11#1) && #race[list_add_~head#1.base,3 + list_add_~head#1.offset] == list_add_#t~nondet11#1;
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033: assume !(((#race[list_add_~head#1.base,list_add_~head#1.offset] == list_add_#t~nondet11#1 && #race[list_add_~head#1.base,1 + list_add_~head#1.offset] == list_add_#t~nondet11#1) && #race[list_add_~head#1.base,2 + list_add_~head#1.offset] == list_add_#t~nondet11#1) && #race[list_add_~head#1.base,3 + list_add_~head#1.offset] == list_add_#t~nondet11#1);
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-1: havoc list_add_#t~nondet11#1;
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-2: #race := #race[list_add_~head#1.base,3 + list_add_~head#1.offset := list_add_#t~nondet11#1];
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-3: #race := #race[list_add_~head#1.base,2 + list_add_~head#1.offset := list_add_#t~nondet11#1];
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-4: #race := #race[list_add_~head#1.base,1 + list_add_~head#1.offset := list_add_#t~nondet11#1];
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-5: #race := #race[list_add_~head#1.base,list_add_~head#1.offset := list_add_#t~nondet11#1];
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-6: havoc list_add_#t~nondet11#1;
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-7: SUMMARY for call write~$Pointer$(list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, 4); srcloc: null
[2025-02-08 05:36:30,633 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1059-1: havoc main_#t~post33#1;
[2025-02-08 05:36:30,772 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-08 05:36:30,772 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 05:36:30,806 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 05:36:30,811 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 05:36:30,811 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:30 BoogieIcfgContainer
[2025-02-08 05:36:30,811 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 05:36:30,813 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-08 05:36:30,813 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-08 05:36:30,817 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-08 05:36:30,817 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:36:29" (1/3) ...
[2025-02-08 05:36:30,818 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ade6137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:30, skipping insertion in model container
[2025-02-08 05:36:30,818 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:29" (2/3) ...
[2025-02-08 05:36:30,818 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ade6137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:30, skipping insertion in model container
[2025-02-08 05:36:30,819 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:30" (3/3) ...
[2025-02-08 05:36:30,819 INFO  L128   eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i
[2025-02-08 05:36:30,831 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-08 05:36:30,832 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_91-arrayloop2_racefree.i that has 2 procedures, 330 locations, 1 initial locations, 11 loop locations, and 19 error locations.
[2025-02-08 05:36:30,832 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-08 05:36:30,924 INFO  L143    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2025-02-08 05:36:30,965 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 333 places, 348 transitions, 703 flow
[2025-02-08 05:36:31,086 INFO  L124   PetriNetUnfolderBase]: 18/378 cut-off events.
[2025-02-08 05:36:31,089 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2025-02-08 05:36:31,098 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 383 conditions, 378 events. 18/378 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 914 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 194. Up to 4 conditions per place. 
[2025-02-08 05:36:31,099 INFO  L82        GeneralOperation]: Start removeDead. Operand has 333 places, 348 transitions, 703 flow
[2025-02-08 05:36:31,108 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 328 places, 343 transitions, 693 flow
[2025-02-08 05:36:31,117 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-08 05:36:31,128 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;@2c54b5dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-08 05:36:31,128 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2025-02-08 05:36:31,156 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-08 05:36:31,158 INFO  L124   PetriNetUnfolderBase]: 0/118 cut-off events.
[2025-02-08 05:36:31,158 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 05:36:31,158 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:36:31,159 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:36:31,159 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2025-02-08 05:36:31,164 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:36:31,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784757231, now seen corresponding path program 1 times
[2025-02-08 05:36:31,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:36:31,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478311815]
[2025-02-08 05:36:31,169 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:36:31,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:36:31,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-02-08 05:36:31,323 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-02-08 05:36:31,324 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:36:31,324 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:36:32,128 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:36:32,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:36:32,129 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478311815]
[2025-02-08 05:36:32,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478311815] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:36:32,130 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:36:32,130 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:36:32,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123966538]
[2025-02-08 05:36:32,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:36:32,137 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:36:32,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:36:32,157 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:36:32,157 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:36:32,532 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 262 out of 348
[2025-02-08 05:36:32,538 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 343 transitions, 693 flow. Second operand  has 6 states, 6 states have (on average 263.3333333333333) internal successors, (1580), 6 states have internal predecessors, (1580), 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:36:32,538 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:36:32,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 348
[2025-02-08 05:36:32,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:36:32,821 INFO  L124   PetriNetUnfolderBase]: 318/1567 cut-off events.
[2025-02-08 05:36:32,821 INFO  L125   PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES.
[2025-02-08 05:36:32,828 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 1567 events. 318/1567 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9718 event pairs, 288 based on Foata normal form. 113/1556 useless extension candidates. Maximal degree in co-relation 1999. Up to 653 conditions per place. 
[2025-02-08 05:36:32,836 INFO  L140   encePairwiseOnDemand]: 323/348 looper letters, 59 selfloop transitions, 10 changer transitions 0/326 dead transitions.
[2025-02-08 05:36:32,837 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 326 transitions, 797 flow
[2025-02-08 05:36:32,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:36:32,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:36:32,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1656 transitions.
[2025-02-08 05:36:32,857 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7931034482758621
[2025-02-08 05:36:32,858 INFO  L175             Difference]: Start difference. First operand has 328 places, 343 transitions, 693 flow. Second operand 6 states and 1656 transitions.
[2025-02-08 05:36:32,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 326 transitions, 797 flow
[2025-02-08 05:36:32,864 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 326 transitions, 797 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-08 05:36:32,869 INFO  L231             Difference]: Finished difference. Result has 329 places, 326 transitions, 679 flow
[2025-02-08 05:36:32,871 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=679, PETRI_PLACES=329, PETRI_TRANSITIONS=326}
[2025-02-08 05:36:32,873 INFO  L279   CegarLoopForPetriNet]: 328 programPoint places, 1 predicate places.
[2025-02-08 05:36:32,875 INFO  L471      AbstractCegarLoop]: Abstraction has has 329 places, 326 transitions, 679 flow
[2025-02-08 05:36:32,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 263.3333333333333) internal successors, (1580), 6 states have internal predecessors, (1580), 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:36:32,876 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:36:32,876 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:36:32,877 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-08 05:36:32,877 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2025-02-08 05:36:32,878 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:36:32,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136310034, now seen corresponding path program 1 times
[2025-02-08 05:36:32,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:36:32,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230346100]
[2025-02-08 05:36:32,879 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:36:32,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:36:32,903 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-02-08 05:36:32,915 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-02-08 05:36:32,915 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:36:32,915 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:36:32,996 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:36:32,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:36:32,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230346100]
[2025-02-08 05:36:32,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230346100] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:36:32,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:36:32,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 05:36:32,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508931051]
[2025-02-08 05:36:32,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:36:32,997 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:36:32,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:36:32,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:36:32,999 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:36:33,013 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 318 out of 348
[2025-02-08 05:36:33,014 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 326 transitions, 679 flow. Second operand  has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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:36:33,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:36:33,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 348
[2025-02-08 05:36:33,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:36:33,098 INFO  L124   PetriNetUnfolderBase]: 13/444 cut-off events.
[2025-02-08 05:36:33,098 INFO  L125   PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES.
[2025-02-08 05:36:33,099 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 505 conditions, 444 events. 13/444 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1144 event pairs, 8 based on Foata normal form. 1/413 useless extension candidates. Maximal degree in co-relation 307. Up to 34 conditions per place. 
[2025-02-08 05:36:33,101 INFO  L140   encePairwiseOnDemand]: 345/348 looper letters, 15 selfloop transitions, 2 changer transitions 0/327 dead transitions.
[2025-02-08 05:36:33,101 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 327 transitions, 715 flow
[2025-02-08 05:36:33,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:36:33,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:36:33,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions.
[2025-02-08 05:36:33,104 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9310344827586207
[2025-02-08 05:36:33,105 INFO  L175             Difference]: Start difference. First operand has 329 places, 326 transitions, 679 flow. Second operand 3 states and 972 transitions.
[2025-02-08 05:36:33,105 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 327 transitions, 715 flow
[2025-02-08 05:36:33,108 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 327 transitions, 695 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-08 05:36:33,114 INFO  L231             Difference]: Finished difference. Result has 327 places, 327 transitions, 671 flow
[2025-02-08 05:36:33,114 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=327, PETRI_TRANSITIONS=327}
[2025-02-08 05:36:33,115 INFO  L279   CegarLoopForPetriNet]: 328 programPoint places, -1 predicate places.
[2025-02-08 05:36:33,115 INFO  L471      AbstractCegarLoop]: Abstraction has has 327 places, 327 transitions, 671 flow
[2025-02-08 05:36:33,116 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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:36:33,116 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:36:33,116 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:36:33,116 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-08 05:36:33,116 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2025-02-08 05:36:33,118 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:36:33,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 2046909010, now seen corresponding path program 1 times
[2025-02-08 05:36:33,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:36:33,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872355141]
[2025-02-08 05:36:33,118 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:36:33,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:36:33,137 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-02-08 05:36:33,148 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-02-08 05:36:33,149 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:36:33,149 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:36:33,547 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:36:33,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:36:33,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872355141]
[2025-02-08 05:36:33,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872355141] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:36:33,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:36:33,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:36:33,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218097138]
[2025-02-08 05:36:33,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:36:33,548 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:36:33,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:36:33,549 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:36:33,549 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:36:33,914 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 262 out of 348
[2025-02-08 05:36:33,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 327 transitions, 671 flow. Second operand  has 6 states, 6 states have (on average 263.3333333333333) internal successors, (1580), 6 states have internal predecessors, (1580), 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:36:33,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:36:33,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 348
[2025-02-08 05:36:33,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:36:34,198 INFO  L124   PetriNetUnfolderBase]: 318/1627 cut-off events.
[2025-02-08 05:36:34,198 INFO  L125   PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES.
[2025-02-08 05:36:34,200 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1627 events. 318/1627 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9887 event pairs, 288 based on Foata normal form. 2/1505 useless extension candidates. Maximal degree in co-relation 2143. Up to 664 conditions per place. 
[2025-02-08 05:36:34,203 INFO  L140   encePairwiseOnDemand]: 337/348 looper letters, 55 selfloop transitions, 5 changer transitions 19/325 dead transitions.
[2025-02-08 05:36:34,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 325 transitions, 801 flow
[2025-02-08 05:36:34,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:36:34,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:36:34,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1641 transitions.
[2025-02-08 05:36:34,207 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7859195402298851
[2025-02-08 05:36:34,207 INFO  L175             Difference]: Start difference. First operand has 327 places, 327 transitions, 671 flow. Second operand 6 states and 1641 transitions.
[2025-02-08 05:36:34,207 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 325 transitions, 801 flow
[2025-02-08 05:36:34,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 325 transitions, 799 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-08 05:36:34,211 INFO  L231             Difference]: Finished difference. Result has 329 places, 306 transitions, 637 flow
[2025-02-08 05:36:34,212 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=329, PETRI_TRANSITIONS=306}
[2025-02-08 05:36:34,212 INFO  L279   CegarLoopForPetriNet]: 328 programPoint places, 1 predicate places.
[2025-02-08 05:36:34,212 INFO  L471      AbstractCegarLoop]: Abstraction has has 329 places, 306 transitions, 637 flow
[2025-02-08 05:36:34,213 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 263.3333333333333) internal successors, (1580), 6 states have internal predecessors, (1580), 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:36:34,213 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:36:34,214 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:36:34,214 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-08 05:36:34,214 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2025-02-08 05:36:34,215 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:36:34,215 INFO  L85        PathProgramCache]: Analyzing trace with hash 96057900, now seen corresponding path program 1 times
[2025-02-08 05:36:34,215 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:36:34,215 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692893466]
[2025-02-08 05:36:34,215 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:36:34,215 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:36:34,232 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-02-08 05:36:34,242 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-02-08 05:36:34,242 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:36:34,242 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:36:34,666 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:36:34,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:36:34,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692893466]
[2025-02-08 05:36:34,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692893466] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:36:34,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:36:34,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:36:34,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254561946]
[2025-02-08 05:36:34,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:36:34,667 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:36:34,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:36:34,668 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:36:34,668 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:36:34,873 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 262 out of 348
[2025-02-08 05:36:34,875 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 306 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 264.6666666666667) internal successors, (1588), 6 states have internal predecessors, (1588), 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:36:34,875 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:36:34,875 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 348
[2025-02-08 05:36:34,875 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:36:35,021 INFO  L124   PetriNetUnfolderBase]: 318/1587 cut-off events.
[2025-02-08 05:36:35,021 INFO  L125   PetriNetUnfolderBase]: For 9/17 co-relation queries the response was YES.
[2025-02-08 05:36:35,024 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 1587 events. 318/1587 cut-off events. For 9/17 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9583 event pairs, 288 based on Foata normal form. 2/1467 useless extension candidates. Maximal degree in co-relation 2107. Up to 662 conditions per place. 
[2025-02-08 05:36:35,031 INFO  L140   encePairwiseOnDemand]: 343/348 looper letters, 54 selfloop transitions, 0 changer transitions 14/305 dead transitions.
[2025-02-08 05:36:35,031 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 305 transitions, 757 flow
[2025-02-08 05:36:35,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:36:35,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:36:35,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1634 transitions.
[2025-02-08 05:36:35,035 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7825670498084292
[2025-02-08 05:36:35,035 INFO  L175             Difference]: Start difference. First operand has 329 places, 306 transitions, 637 flow. Second operand 6 states and 1634 transitions.
[2025-02-08 05:36:35,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 305 transitions, 757 flow
[2025-02-08 05:36:35,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 305 transitions, 747 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-08 05:36:35,040 INFO  L231             Difference]: Finished difference. Result has 309 places, 291 transitions, 597 flow
[2025-02-08 05:36:35,041 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=597, PETRI_PLACES=309, PETRI_TRANSITIONS=291}
[2025-02-08 05:36:35,042 INFO  L279   CegarLoopForPetriNet]: 328 programPoint places, -19 predicate places.
[2025-02-08 05:36:35,042 INFO  L471      AbstractCegarLoop]: Abstraction has has 309 places, 291 transitions, 597 flow
[2025-02-08 05:36:35,043 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 264.6666666666667) internal successors, (1588), 6 states have internal predecessors, (1588), 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:36:35,043 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:36:35,043 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:36:35,043 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-08 05:36:35,043 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2025-02-08 05:36:35,044 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:36:35,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 1015763822, now seen corresponding path program 1 times
[2025-02-08 05:36:35,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:36:35,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465535681]
[2025-02-08 05:36:35,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:36:35,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:36:35,066 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-02-08 05:36:35,071 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-02-08 05:36:35,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:36:35,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:36:35,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:36:35,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:36:35,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465535681]
[2025-02-08 05:36:35,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465535681] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:36:35,124 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:36:35,124 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 05:36:35,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390671908]
[2025-02-08 05:36:35,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:36:35,124 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:36:35,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:36:35,125 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:36:35,125 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:36:35,132 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 319 out of 348
[2025-02-08 05:36:35,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 291 transitions, 597 flow. Second operand  has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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:36:35,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:36:35,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 348
[2025-02-08 05:36:35,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:36:35,138 INFO  L124   PetriNetUnfolderBase]: 0/112 cut-off events.
[2025-02-08 05:36:35,138 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 05:36:35,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 112 events. 0/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. 
[2025-02-08 05:36:35,138 INFO  L140   encePairwiseOnDemand]: 346/348 looper letters, 0 selfloop transitions, 0 changer transitions 112/112 dead transitions.
[2025-02-08 05:36:35,138 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 230 flow
[2025-02-08 05:36:35,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:36:35,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:36:35,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions.
[2025-02-08 05:36:35,140 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9195402298850575
[2025-02-08 05:36:35,140 INFO  L175             Difference]: Start difference. First operand has 309 places, 291 transitions, 597 flow. Second operand 3 states and 960 transitions.
[2025-02-08 05:36:35,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 230 flow
[2025-02-08 05:36:35,141 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 112 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-08 05:36:35,141 INFO  L231             Difference]: Finished difference. Result has 118 places, 0 transitions, 0 flow
[2025-02-08 05:36:35,141 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=118, PETRI_TRANSITIONS=0}
[2025-02-08 05:36:35,142 INFO  L279   CegarLoopForPetriNet]: 328 programPoint places, -210 predicate places.
[2025-02-08 05:36:35,142 INFO  L471      AbstractCegarLoop]: Abstraction has has 118 places, 0 transitions, 0 flow
[2025-02-08 05:36:35,142 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining)
[2025-02-08 05:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining)
[2025-02-08 05:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining)
[2025-02-08 05:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining)
[2025-02-08 05:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining)
[2025-02-08 05:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining)
[2025-02-08 05:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining)
[2025-02-08 05:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 22 remaining)
[2025-02-08 05:36:35,146 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining)
[2025-02-08 05:36:35,147 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining)
[2025-02-08 05:36:35,147 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-08 05:36:35,148 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2025-02-08 05:36:35,152 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-02-08 05:36:35,152 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-08 05:36:35,157 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:36:35 BasicIcfg
[2025-02-08 05:36:35,157 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-08 05:36:35,158 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-08 05:36:35,158 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-08 05:36:35,158 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-08 05:36:35,158 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:30" (3/4) ...
[2025-02-08 05:36:35,159 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-08 05:36:35,161 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun
[2025-02-08 05:36:35,165 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges
[2025-02-08 05:36:35,166 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-08 05:36:35,166 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-08 05:36:35,166 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-08 05:36:35,230 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-08 05:36:35,230 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-08 05:36:35,230 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-08 05:36:35,231 INFO  L158              Benchmark]: Toolchain (without parser) took 5734.74ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 112.7MB in the beginning and 281.6MB in the end (delta: -169.0MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB.
[2025-02-08 05:36:35,231 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 05:36:35,231 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 405.29ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 79.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-02-08 05:36:35,232 INFO  L158              Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 75.0MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 05:36:35,232 INFO  L158              Benchmark]: Boogie Preprocessor took 30.11ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 71.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 05:36:35,232 INFO  L158              Benchmark]: IcfgBuilder took 826.33ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 96.0MB in the end (delta: -25.0MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB.
[2025-02-08 05:36:35,232 INFO  L158              Benchmark]: TraceAbstraction took 4344.40ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 95.3MB in the beginning and 289.6MB in the end (delta: -194.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB.
[2025-02-08 05:36:35,232 INFO  L158              Benchmark]: Witness Printer took 72.90ms. Allocated memory is still 352.3MB. Free memory was 289.6MB in the beginning and 281.6MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 05:36:35,233 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 405.29ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 79.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 75.0MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 30.11ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 71.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 826.33ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 96.0MB in the end (delta: -25.0MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 4344.40ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 95.3MB in the beginning and 289.6MB in the end (delta: -194.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB.
 * Witness Printer took 72.90ms. Allocated memory is still 352.3MB. Free memory was 289.6MB in the beginning and 281.6MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 1019]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1061]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1062]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1020]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1024]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1019]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1020]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1043]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1047]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1046]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1046]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1046]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1046]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1046]: there are no data races
    For all program executions holds that there are no data races at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 461 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 774 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1354 IncrementalHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 104 mSDtfsCounter, 1354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    19 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-02-08 05:36:35,248 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE