./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.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_92-evilcollapse_racing.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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:36:36,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:36:36,701 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:36,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:36:36,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:36:36,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:36:36,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:36:36,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:36:36,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:36:36,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:36:36,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:36:36,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:36:36,734 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:36:36,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:36:36,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:36:36,735 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:36:36,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:36:36,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:36:36,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:36:36,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:36:36,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:36:36,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:36:36,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:36:36,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:36,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:36:36,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:36:36,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:36:36,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:36:36,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:36:36,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:36:36,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:36:36,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:36:36,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:36:36,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:36:36,739 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2025-02-08 05:36:37,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:36:37,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:36:37,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:36:37,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:36:37,049 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:36:37,051 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_92-evilcollapse_racing.i [2025-02-08 05:36:38,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c0d76b4a/b798bb1393ef4ca09de6cd1d0c3d241d/FLAG1a3a046ba [2025-02-08 05:36:38,700 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:36:38,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-02-08 05:36:38,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c0d76b4a/b798bb1393ef4ca09de6cd1d0c3d241d/FLAG1a3a046ba [2025-02-08 05:36:38,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c0d76b4a/b798bb1393ef4ca09de6cd1d0c3d241d [2025-02-08 05:36:38,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:36:38,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:36:38,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:38,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:36:38,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:36:38,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:38" (1/1) ... [2025-02-08 05:36:38,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545bad14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:38, skipping insertion in model container [2025-02-08 05:36:38,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:38" (1/1) ... [2025-02-08 05:36:38,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:36:39,219 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:39,220 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:39,221 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:39,221 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:39,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:39,292 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:36:39,351 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:39,352 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:39,352 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:39,353 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:36:39,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:39,433 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:36:39,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:39 WrapperNode [2025-02-08 05:36:39,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:39,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:39,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:36:39,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:36:39,441 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:39" (1/1) ... [2025-02-08 05:36:39,471 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:39" (1/1) ... [2025-02-08 05:36:39,518 INFO L138 Inliner]: procedures = 280, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 433 [2025-02-08 05:36:39,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:39,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:36:39,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:36:39,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:36:39,531 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:39" (1/1) ... [2025-02-08 05:36:39,532 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:39" (1/1) ... [2025-02-08 05:36:39,541 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:39" (1/1) ... [2025-02-08 05:36:39,543 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:39" (1/1) ... [2025-02-08 05:36:39,582 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:39" (1/1) ... [2025-02-08 05:36:39,584 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:39" (1/1) ... [2025-02-08 05:36:39,590 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:39" (1/1) ... [2025-02-08 05:36:39,592 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:39" (1/1) ... [2025-02-08 05:36:39,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:36:39,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:36:39,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:36:39,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:36:39,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:39" (1/1) ... [2025-02-08 05:36:39,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:39,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:36:39,637 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:39,640 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:39,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:36:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:36:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:36:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:36:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:36:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:36:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:36:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:36:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:36:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:36:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:36:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:36:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:36:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:36:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:36:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:36:39,664 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:39,829 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:36:39,831 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:36:40,486 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:40,487 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:40,487 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:40,487 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:40,487 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:40,487 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:40,487 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:40,487 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:40,487 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:40,487 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:40,488 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:40,488 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:40,488 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:40,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-1: havoc list_add_#t~nondet8#1; [2025-02-08 05:36:40,488 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:40,488 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:40,488 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:40,488 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:40,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-6: havoc list_add_#t~nondet8#1; [2025-02-08 05:36:40,488 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:40,488 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:40,488 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:40,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-1: havoc list_add_#t~nondet9#1; [2025-02-08 05:36:40,488 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:40,488 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:40,488 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:40,488 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:40,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031-6: havoc list_add_#t~nondet9#1; [2025-02-08 05:36:40,489 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:40,489 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:40,489 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:40,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-1: havoc list_add_#t~nondet10#1; [2025-02-08 05:36:40,489 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:40,489 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:40,489 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:40,490 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:40,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-6: havoc list_add_#t~nondet10#1; [2025-02-08 05:36:40,491 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:40,491 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:40,491 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:40,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-1: havoc list_add_#t~nondet11#1; [2025-02-08 05:36:40,491 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:40,491 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:40,491 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:40,491 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:40,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-6: havoc list_add_#t~nondet11#1; [2025-02-08 05:36:40,492 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:40,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-1: havoc main_#t~post35#1; [2025-02-08 05:36:40,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-2: main_~j~1#1 := 1 + main_#t~post35#1; [2025-02-08 05:36:40,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-3: assume { :end_inline_list_add } true;main_#t~post35#1 := main_~j~1#1; [2025-02-08 05:36:40,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-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:40,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-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:40,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-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:40,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-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~ret34#1.base, 4 + main_#t~ret34#1.offset, ~#c~0.base, 4 + (~#c~0.offset + 12 * main_~i~0#1); [2025-02-08 05:36:40,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-8: havoc new_#in~x#1; [2025-02-08 05:36:40,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-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:40,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-10: main_#t~ret34#1.base, main_#t~ret34#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:36:40,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:36:40,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072-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:40,665 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:36:40,665 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:36:40,705 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:36:40,707 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:36:40,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:40 BoogieIcfgContainer [2025-02-08 05:36:40,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:36:40,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:36:40,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:36:40,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:36:40,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:36:38" (1/3) ... [2025-02-08 05:36:40,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6bc244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:40, skipping insertion in model container [2025-02-08 05:36:40,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:39" (2/3) ... [2025-02-08 05:36:40,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6bc244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:40, skipping insertion in model container [2025-02-08 05:36:40,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:40" (3/3) ... [2025-02-08 05:36:40,717 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2025-02-08 05:36:40,731 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:36:40,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_92-evilcollapse_racing.i that has 2 procedures, 421 locations, 1 initial locations, 11 loop locations, and 23 error locations. [2025-02-08 05:36:40,732 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:36:40,832 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:36:40,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 424 places, 441 transitions, 889 flow [2025-02-08 05:36:41,076 INFO L124 PetriNetUnfolderBase]: 20/471 cut-off events. [2025-02-08 05:36:41,079 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:36:41,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 471 events. 20/471 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 703 event pairs, 0 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 287. Up to 4 conditions per place. [2025-02-08 05:36:41,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 424 places, 441 transitions, 889 flow [2025-02-08 05:36:41,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 419 places, 436 transitions, 879 flow [2025-02-08 05:36:41,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:36:41,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;@7b72ae0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:36:41,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 05:36:41,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:36:41,148 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-02-08 05:36:41,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:36:41,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:41,149 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] [2025-02-08 05:36:41,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:36:41,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1739398713, now seen corresponding path program 1 times [2025-02-08 05:36:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:41,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721079713] [2025-02-08 05:36:41,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:41,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:36:41,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:36:41,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:41,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:42,467 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:42,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721079713] [2025-02-08 05:36:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721079713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:42,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:42,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666589234] [2025-02-08 05:36:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:42,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:42,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:42,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:42,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:43,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 441 [2025-02-08 05:36:43,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 436 transitions, 879 flow. Second operand has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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:43,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:43,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 441 [2025-02-08 05:36:43,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:43,801 INFO L124 PetriNetUnfolderBase]: 318/1658 cut-off events. [2025-02-08 05:36:43,801 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-02-08 05:36:43,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 1658 events. 318/1658 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9438 event pairs, 288 based on Foata normal form. 115/1643 useless extension candidates. Maximal degree in co-relation 1999. Up to 669 conditions per place. [2025-02-08 05:36:43,816 INFO L140 encePairwiseOnDemand]: 414/441 looper letters, 75 selfloop transitions, 10 changer transitions 2/417 dead transitions. [2025-02-08 05:36:43,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 417 transitions, 1011 flow [2025-02-08 05:36:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2124 transitions. [2025-02-08 05:36:43,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2025-02-08 05:36:43,840 INFO L175 Difference]: Start difference. First operand has 419 places, 436 transitions, 879 flow. Second operand 6 states and 2124 transitions. [2025-02-08 05:36:43,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 417 transitions, 1011 flow [2025-02-08 05:36:43,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 1011 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:36:43,861 INFO L231 Difference]: Finished difference. Result has 420 places, 415 transitions, 857 flow [2025-02-08 05:36:43,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=857, PETRI_PLACES=420, PETRI_TRANSITIONS=415} [2025-02-08 05:36:43,868 INFO L279 CegarLoopForPetriNet]: 419 programPoint places, 1 predicate places. [2025-02-08 05:36:43,868 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 415 transitions, 857 flow [2025-02-08 05:36:43,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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:43,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:43,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:36:43,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:36:43,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1276632298, now seen corresponding path program 1 times [2025-02-08 05:36:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757275689] [2025-02-08 05:36:43,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:43,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:36:43,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:36:43,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:43,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:44,511 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:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757275689] [2025-02-08 05:36:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757275689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138660186] [2025-02-08 05:36:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:44,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:44,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:44,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 441 [2025-02-08 05:36:44,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 415 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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:44,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:44,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 441 [2025-02-08 05:36:44,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:45,271 INFO L124 PetriNetUnfolderBase]: 318/1654 cut-off events. [2025-02-08 05:36:45,271 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-02-08 05:36:45,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2348 conditions, 1654 events. 318/1654 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9447 event pairs, 288 based on Foata normal form. 1/1528 useless extension candidates. Maximal degree in co-relation 2258. Up to 668 conditions per place. [2025-02-08 05:36:45,280 INFO L140 encePairwiseOnDemand]: 430/441 looper letters, 71 selfloop transitions, 5 changer transitions 19/413 dead transitions. [2025-02-08 05:36:45,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 413 transitions, 1019 flow [2025-02-08 05:36:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2107 transitions. [2025-02-08 05:36:45,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7962962962962963 [2025-02-08 05:36:45,289 INFO L175 Difference]: Start difference. First operand has 420 places, 415 transitions, 857 flow. Second operand 6 states and 2107 transitions. [2025-02-08 05:36:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 413 transitions, 1019 flow [2025-02-08 05:36:45,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 413 transitions, 999 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:36:45,302 INFO L231 Difference]: Finished difference. Result has 416 places, 394 transitions, 805 flow [2025-02-08 05:36:45,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=805, PETRI_PLACES=416, PETRI_TRANSITIONS=394} [2025-02-08 05:36:45,304 INFO L279 CegarLoopForPetriNet]: 419 programPoint places, -3 predicate places. [2025-02-08 05:36:45,304 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 394 transitions, 805 flow [2025-02-08 05:36:45,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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:45,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:45,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:45,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:36:45,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:36:45,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:45,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1569696312, now seen corresponding path program 1 times [2025-02-08 05:36:45,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:45,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508673557] [2025-02-08 05:36:45,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:45,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:45,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:36:45,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:36:45,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:45,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:45,466 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:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508673557] [2025-02-08 05:36:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508673557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:36:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518236917] [2025-02-08 05:36:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:45,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:45,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:45,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:45,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 441 [2025-02-08 05:36:45,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 394 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:45,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:45,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 441 [2025-02-08 05:36:45,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:45,591 INFO L124 PetriNetUnfolderBase]: 13/491 cut-off events. [2025-02-08 05:36:45,591 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:36:45,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 491 events. 13/491 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 764 event pairs, 8 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 376. Up to 34 conditions per place. [2025-02-08 05:36:45,594 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 15 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2025-02-08 05:36:45,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 395 transitions, 841 flow [2025-02-08 05:36:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-02-08 05:36:45,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9410430839002267 [2025-02-08 05:36:45,598 INFO L175 Difference]: Start difference. First operand has 416 places, 394 transitions, 805 flow. Second operand 3 states and 1245 transitions. [2025-02-08 05:36:45,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 395 transitions, 841 flow [2025-02-08 05:36:45,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 395 transitions, 831 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:36:45,608 INFO L231 Difference]: Finished difference. Result has 395 places, 395 transitions, 807 flow [2025-02-08 05:36:45,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=395, PETRI_TRANSITIONS=395} [2025-02-08 05:36:45,610 INFO L279 CegarLoopForPetriNet]: 419 programPoint places, -24 predicate places. [2025-02-08 05:36:45,610 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 395 transitions, 807 flow [2025-02-08 05:36:45,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:45,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:45,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:45,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:36:45,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:36:45,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash 221126351, now seen corresponding path program 1 times [2025-02-08 05:36:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:45,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558465876] [2025-02-08 05:36:45,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:45,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 05:36:45,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 05:36:45,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:45,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:46,263 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:46,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558465876] [2025-02-08 05:36:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558465876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:46,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:46,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:46,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873316104] [2025-02-08 05:36:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:46,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:46,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:46,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:46,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 441 [2025-02-08 05:36:46,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 395 transitions, 807 flow. Second operand has 6 states, 6 states have (on average 339.6666666666667) internal successors, (2038), 6 states have internal predecessors, (2038), 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:46,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:46,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 441 [2025-02-08 05:36:46,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:46,917 INFO L124 PetriNetUnfolderBase]: 318/1676 cut-off events. [2025-02-08 05:36:46,918 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-02-08 05:36:46,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 1676 events. 318/1676 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9451 event pairs, 288 based on Foata normal form. 2/1552 useless extension candidates. Maximal degree in co-relation 2210. Up to 678 conditions per place. [2025-02-08 05:36:46,927 INFO L140 encePairwiseOnDemand]: 436/441 looper letters, 70 selfloop transitions, 0 changer transitions 14/394 dead transitions. [2025-02-08 05:36:46,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 394 transitions, 959 flow [2025-02-08 05:36:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2100 transitions. [2025-02-08 05:36:46,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2025-02-08 05:36:46,933 INFO L175 Difference]: Start difference. First operand has 395 places, 395 transitions, 807 flow. Second operand 6 states and 2100 transitions. [2025-02-08 05:36:46,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 394 transitions, 959 flow [2025-02-08 05:36:46,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 394 transitions, 957 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:36:46,939 INFO L231 Difference]: Finished difference. Result has 398 places, 380 transitions, 775 flow [2025-02-08 05:36:46,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=775, PETRI_PLACES=398, PETRI_TRANSITIONS=380} [2025-02-08 05:36:46,941 INFO L279 CegarLoopForPetriNet]: 419 programPoint places, -21 predicate places. [2025-02-08 05:36:46,941 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 380 transitions, 775 flow [2025-02-08 05:36:46,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 339.6666666666667) internal successors, (2038), 6 states have internal predecessors, (2038), 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:46,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:46,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:46,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:36:46,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:36:46,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash 444529188, now seen corresponding path program 1 times [2025-02-08 05:36:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61276904] [2025-02-08 05:36:46,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:46,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:36:46,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:36:46,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:46,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:47,029 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:47,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:47,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61276904] [2025-02-08 05:36:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61276904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:47,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:47,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:36:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863755980] [2025-02-08 05:36:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:47,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:47,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:47,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 441 [2025-02-08 05:36:47,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 380 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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:47,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:47,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 441 [2025-02-08 05:36:47,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:47,049 INFO L124 PetriNetUnfolderBase]: 0/124 cut-off events. [2025-02-08 05:36:47,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:36:47,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 124 events. 0/124 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/125 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-08 05:36:47,050 INFO L140 encePairwiseOnDemand]: 439/441 looper letters, 0 selfloop transitions, 0 changer transitions 124/124 dead transitions. [2025-02-08 05:36:47,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 254 flow [2025-02-08 05:36:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2025-02-08 05:36:47,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9319727891156463 [2025-02-08 05:36:47,053 INFO L175 Difference]: Start difference. First operand has 398 places, 380 transitions, 775 flow. Second operand 3 states and 1233 transitions. [2025-02-08 05:36:47,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 254 flow [2025-02-08 05:36:47,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 124 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:36:47,055 INFO L231 Difference]: Finished difference. Result has 130 places, 0 transitions, 0 flow [2025-02-08 05:36:47,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=130, PETRI_TRANSITIONS=0} [2025-02-08 05:36:47,056 INFO L279 CegarLoopForPetriNet]: 419 programPoint places, -289 predicate places. [2025-02-08 05:36:47,056 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 0 transitions, 0 flow [2025-02-08 05:36:47,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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:47,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (25 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-02-08 05:36:47,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-02-08 05:36:47,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-02-08 05:36:47,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-02-08 05:36:47,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-02-08 05:36:47,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-02-08 05:36:47,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-02-08 05:36:47,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:36:47,062 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:36:47,067 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:36:47,068 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:36:47,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:36:47 BasicIcfg [2025-02-08 05:36:47,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:36:47,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:36:47,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:36:47,076 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:36:47,077 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:40" (3/4) ... [2025-02-08 05:36:47,079 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:36:47,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 05:36:47,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-08 05:36:47,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:36:47,091 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:36:47,091 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:36:47,187 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:36:47,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:36:47,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:36:47,189 INFO L158 Benchmark]: Toolchain (without parser) took 8436.00ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 112.6MB in the beginning and 63.7MB in the end (delta: 48.9MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. [2025-02-08 05:36:47,189 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:36:47,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.98ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 78.8MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:36:47,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.44ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 73.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:36:47,192 INFO L158 Benchmark]: Boogie Preprocessor took 79.05ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 69.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:36:47,192 INFO L158 Benchmark]: IcfgBuilder took 1104.94ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 87.7MB in the end (delta: -18.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:36:47,193 INFO L158 Benchmark]: TraceAbstraction took 6365.93ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 87.0MB in the beginning and 72.1MB in the end (delta: 14.9MB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. [2025-02-08 05:36:47,194 INFO L158 Benchmark]: Witness Printer took 111.67ms. Allocated memory is still 243.3MB. Free memory was 72.1MB in the beginning and 63.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:36:47,196 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.29ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 679.98ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 78.8MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.44ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 73.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.05ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 69.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1104.94ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 87.7MB in the end (delta: -18.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6365.93ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 87.0MB in the beginning and 72.1MB in the end (delta: 14.9MB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. * Witness Printer took 111.67ms. Allocated memory is still 243.3MB. Free memory was 72.1MB in the beginning and 63.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 1039]: 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: 1039]: 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: 1071]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1071]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1072]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1073]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1050]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1054]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1053]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1053]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1053]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1053]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1053]: 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, 552 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 875 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1633 IncrementalHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 135 mSDtfsCounter, 1633 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=879occurred 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, 2.5s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 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 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:36:47,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE