./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.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/09-regions_23-evilcollapse_rc.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 edbdacd2fc511db63719a3e7d2bd257b6310a833f5bcfcddcb6829e714260082 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:49,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:49,435 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:32:49,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:49,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:49,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:49,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:49,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:49,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:49,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:49,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:49,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:49,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:49,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:49,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:49,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:49,491 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 -> edbdacd2fc511db63719a3e7d2bd257b6310a833f5bcfcddcb6829e714260082 [2025-02-08 05:32:49,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:49,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:49,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:49,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:49,906 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:49,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-02-08 05:32:51,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1504674/df117862ba12411cbf23108fcf2390bd/FLAG1560aeb6f [2025-02-08 05:32:51,475 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:51,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-02-08 05:32:51,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1504674/df117862ba12411cbf23108fcf2390bd/FLAG1560aeb6f [2025-02-08 05:32:51,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1504674/df117862ba12411cbf23108fcf2390bd [2025-02-08 05:32:51,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:51,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:51,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:51,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:51,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:51,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:51" (1/1) ... [2025-02-08 05:32:51,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e25f51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:51, skipping insertion in model container [2025-02-08 05:32:51,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:51" (1/1) ... [2025-02-08 05:32:51,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:52,082 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:52,083 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:52,083 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:52,084 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:52,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:52,137 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:52,192 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:52,195 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:52,196 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:52,196 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:52,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:52,256 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:52,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52 WrapperNode [2025-02-08 05:32:52,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:52,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:52,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:52,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:52,263 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:32:52" (1/1) ... [2025-02-08 05:32:52,277 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:32:52" (1/1) ... [2025-02-08 05:32:52,304 INFO L138 Inliner]: procedures = 274, calls = 101, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 322 [2025-02-08 05:32:52,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:52,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:52,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:52,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:52,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:52,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:52,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:52,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:52,351 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (1/1) ... [2025-02-08 05:32:52,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:52,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:52,384 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:32:52,392 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:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-08 05:32:52,405 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-08 05:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:52,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:52,407 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:32:52,532 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:52,534 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:53,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015: 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:32:53,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-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:32:53,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016: havoc list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset; [2025-02-08 05:32:53,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-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:32:53,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-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:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-2: list_add_~next~0#1.base, list_add_~next~0#1.offset := list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset; [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-3: #race := #race[list_add_~head#1.base,3 + list_add_~head#1.offset := 0]; [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-4: #race := #race[list_add_~head#1.base,2 + list_add_~head#1.offset := 0]; [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-5: #race := #race[list_add_~head#1.base,1 + list_add_~head#1.offset := 0]; [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-6: #race := #race[list_add_~head#1.base,list_add_~head#1.offset := 0]; [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-7: SUMMARY for call list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset := read~$Pointer$(list_add_~head#1.base, list_add_~head#1.offset, 4); srcloc: null [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017: assume ((#race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1 && #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1) && #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1) && #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1; [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017: assume !(((#race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1 && #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1) && #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1) && #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1); [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-1: havoc list_add_#t~nondet7#1; [2025-02-08 05:32:53,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: #race := #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset := list_add_#t~nondet7#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-3: #race := #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset := list_add_#t~nondet7#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-4: #race := #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset := list_add_#t~nondet7#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-5: #race := #race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset := list_add_#t~nondet7#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-6: havoc list_add_#t~nondet7#1; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-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:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: assume ((#race[list_add_~new#1.base,list_add_~new#1.offset] == list_add_#t~nondet8#1 && #race[list_add_~new#1.base,1 + list_add_~new#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~new#1.base,2 + list_add_~new#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~new#1.base,3 + list_add_~new#1.offset] == list_add_#t~nondet8#1; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: assume !(((#race[list_add_~new#1.base,list_add_~new#1.offset] == list_add_#t~nondet8#1 && #race[list_add_~new#1.base,1 + list_add_~new#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~new#1.base,2 + list_add_~new#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~new#1.base,3 + list_add_~new#1.offset] == list_add_#t~nondet8#1); [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-1: havoc list_add_#t~nondet8#1; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-2: #race := #race[list_add_~new#1.base,3 + list_add_~new#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-3: #race := #race[list_add_~new#1.base,2 + list_add_~new#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-4: #race := #race[list_add_~new#1.base,1 + list_add_~new#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-5: #race := #race[list_add_~new#1.base,list_add_~new#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-6: havoc list_add_#t~nondet8#1; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-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:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: assume ((#race[list_add_~new#1.base,4 + list_add_~new#1.offset] == list_add_#t~nondet9#1 && #race[list_add_~new#1.base,5 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,6 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,7 + list_add_~new#1.offset] == list_add_#t~nondet9#1; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: assume !(((#race[list_add_~new#1.base,4 + list_add_~new#1.offset] == list_add_#t~nondet9#1 && #race[list_add_~new#1.base,5 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,6 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,7 + list_add_~new#1.offset] == list_add_#t~nondet9#1); [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-1: havoc list_add_#t~nondet9#1; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-2: #race := #race[list_add_~new#1.base,7 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-3: #race := #race[list_add_~new#1.base,6 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-4: #race := #race[list_add_~new#1.base,5 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-5: #race := #race[list_add_~new#1.base,4 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-6: havoc list_add_#t~nondet9#1; [2025-02-08 05:32:53,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-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:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020: assume ((#race[list_add_~head#1.base,list_add_~head#1.offset] == list_add_#t~nondet10#1 && #race[list_add_~head#1.base,1 + list_add_~head#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~head#1.base,2 + list_add_~head#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~head#1.base,3 + list_add_~head#1.offset] == list_add_#t~nondet10#1; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020: assume !(((#race[list_add_~head#1.base,list_add_~head#1.offset] == list_add_#t~nondet10#1 && #race[list_add_~head#1.base,1 + list_add_~head#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~head#1.base,2 + list_add_~head#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~head#1.base,3 + list_add_~head#1.offset] == list_add_#t~nondet10#1); [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-1: havoc list_add_#t~nondet10#1; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-2: #race := #race[list_add_~head#1.base,3 + list_add_~head#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-3: #race := #race[list_add_~head#1.base,2 + list_add_~head#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-4: #race := #race[list_add_~head#1.base,1 + list_add_~head#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-5: #race := #race[list_add_~head#1.base,list_add_~head#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-6: havoc list_add_#t~nondet10#1; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-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:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-1: havoc main_#t~post23#1; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-2: main_~j~1#1 := 1 + main_#t~post23#1; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-3: assume { :end_inline_list_add } true;main_#t~post23#1 := main_~j~1#1; [2025-02-08 05:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-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:32:53,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-5: havoc list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset, list_add_#t~nondet7#1, list_add_#t~nondet8#1, list_add_#t~nondet9#1, list_add_#t~nondet10#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:32:53,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-6: havoc list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset, list_add_#t~nondet7#1, list_add_#t~nondet8#1, list_add_#t~nondet9#1, list_add_#t~nondet10#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:32:53,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-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~ret22#1.base, 4 + main_#t~ret22#1.offset, ~#c~0.base, ~#c~0.offset + 8 * main_~i~0#1; [2025-02-08 05:32:53,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-8: havoc new_#in~x#1; [2025-02-08 05:32:53,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-9: havoc new_#t~malloc4#1.base, new_#t~malloc4#1.offset, new_#t~nondet5#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:53,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1055-10: main_#t~ret22#1.base, main_#t~ret22#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:53,051 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:53,051 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:53,065 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:53,065 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:53,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:53 BoogieIcfgContainer [2025-02-08 05:32:53,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:53,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:53,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:53,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:53,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:51" (1/3) ... [2025-02-08 05:32:53,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fd8227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:53, skipping insertion in model container [2025-02-08 05:32:53,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:52" (2/3) ... [2025-02-08 05:32:53,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fd8227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:53, skipping insertion in model container [2025-02-08 05:32:53,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:53" (3/3) ... [2025-02-08 05:32:53,072 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_23-evilcollapse_rc.i [2025-02-08 05:32:53,082 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:53,083 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_23-evilcollapse_rc.i that has 2 procedures, 316 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-02-08 05:32:53,083 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:53,189 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:53,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 388 places, 390 transitions, 788 flow [2025-02-08 05:32:53,348 INFO L124 PetriNetUnfolderBase]: 9/388 cut-off events. [2025-02-08 05:32:53,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:53,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 388 events. 9/388 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 420 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 315. Up to 2 conditions per place. [2025-02-08 05:32:53,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 388 places, 390 transitions, 788 flow [2025-02-08 05:32:53,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 381 places, 383 transitions, 772 flow [2025-02-08 05:32:53,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:53,384 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;@66a473b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:53,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 05:32:53,398 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:53,398 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-02-08 05:32:53,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:53,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:53,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:53,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:32:53,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1177275515, now seen corresponding path program 1 times [2025-02-08 05:32:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:53,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985606119] [2025-02-08 05:32:53,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:53,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:53,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:32:53,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:32:53,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:53,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:54,298 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:32:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985606119] [2025-02-08 05:32:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985606119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534999225] [2025-02-08 05:32:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:54,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:54,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:54,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:54,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:54,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 390 [2025-02-08 05:32:54,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 383 transitions, 772 flow. Second operand has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 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:32:54,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:54,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 390 [2025-02-08 05:32:54,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:55,384 INFO L124 PetriNetUnfolderBase]: 448/1860 cut-off events. [2025-02-08 05:32:55,385 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:32:55,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 1860 events. 448/1860 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10743 event pairs, 342 based on Foata normal form. 36/1689 useless extension candidates. Maximal degree in co-relation 2477. Up to 841 conditions per place. [2025-02-08 05:32:55,403 INFO L140 encePairwiseOnDemand]: 374/390 looper letters, 67 selfloop transitions, 10 changer transitions 2/377 dead transitions. [2025-02-08 05:32:55,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 377 transitions, 914 flow [2025-02-08 05:32:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1919 transitions. [2025-02-08 05:32:55,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200854700854701 [2025-02-08 05:32:55,418 INFO L175 Difference]: Start difference. First operand has 381 places, 383 transitions, 772 flow. Second operand 6 states and 1919 transitions. [2025-02-08 05:32:55,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 377 transitions, 914 flow [2025-02-08 05:32:55,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 377 transitions, 912 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:32:55,428 INFO L231 Difference]: Finished difference. Result has 382 places, 375 transitions, 774 flow [2025-02-08 05:32:55,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=774, PETRI_PLACES=382, PETRI_TRANSITIONS=375} [2025-02-08 05:32:55,436 INFO L279 CegarLoopForPetriNet]: 381 programPoint places, 1 predicate places. [2025-02-08 05:32:55,436 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 375 transitions, 774 flow [2025-02-08 05:32:55,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 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:32:55,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:55,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:55,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:55,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:32:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1784170083, now seen corresponding path program 1 times [2025-02-08 05:32:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:55,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422754194] [2025-02-08 05:32:55,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:55,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:55,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:32:55,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:32:55,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:55,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:55,843 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:32:55,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422754194] [2025-02-08 05:32:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422754194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:55,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:55,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873542703] [2025-02-08 05:32:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:55,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:55,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:55,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:56,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 390 [2025-02-08 05:32:56,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 375 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 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:32:56,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:56,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 390 [2025-02-08 05:32:56,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:56,465 INFO L124 PetriNetUnfolderBase]: 448/1856 cut-off events. [2025-02-08 05:32:56,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:56,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 1856 events. 448/1856 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10765 event pairs, 342 based on Foata normal form. 1/1653 useless extension candidates. Maximal degree in co-relation 2668. Up to 840 conditions per place. [2025-02-08 05:32:56,475 INFO L140 encePairwiseOnDemand]: 379/390 looper letters, 63 selfloop transitions, 5 changer transitions 19/373 dead transitions. [2025-02-08 05:32:56,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 373 transitions, 920 flow [2025-02-08 05:32:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1913 transitions. [2025-02-08 05:32:56,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175213675213675 [2025-02-08 05:32:56,479 INFO L175 Difference]: Start difference. First operand has 382 places, 375 transitions, 774 flow. Second operand 6 states and 1913 transitions. [2025-02-08 05:32:56,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 373 transitions, 920 flow [2025-02-08 05:32:56,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 373 transitions, 900 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:56,487 INFO L231 Difference]: Finished difference. Result has 378 places, 354 transitions, 722 flow [2025-02-08 05:32:56,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=378, PETRI_TRANSITIONS=354} [2025-02-08 05:32:56,488 INFO L279 CegarLoopForPetriNet]: 381 programPoint places, -3 predicate places. [2025-02-08 05:32:56,488 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 354 transitions, 722 flow [2025-02-08 05:32:56,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 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:32:56,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:56,489 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] [2025-02-08 05:32:56,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:32:56,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:32:56,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:56,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2106403356, now seen corresponding path program 1 times [2025-02-08 05:32:56,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:56,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837587240] [2025-02-08 05:32:56,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:56,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:56,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:32:56,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:32:56,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:56,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:56,601 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:32:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837587240] [2025-02-08 05:32:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837587240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:56,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:56,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379769352] [2025-02-08 05:32:56,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:56,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:56,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:56,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:56,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 390 [2025-02-08 05:32:56,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 354 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 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:32:56,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:56,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 390 [2025-02-08 05:32:56,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:56,692 INFO L124 PetriNetUnfolderBase]: 27/575 cut-off events. [2025-02-08 05:32:56,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:56,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 575 events. 27/575 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1474 event pairs, 18 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 495. Up to 45 conditions per place. [2025-02-08 05:32:56,695 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 11 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-02-08 05:32:56,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 355 transitions, 750 flow [2025-02-08 05:32:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-02-08 05:32:56,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9709401709401709 [2025-02-08 05:32:56,698 INFO L175 Difference]: Start difference. First operand has 378 places, 354 transitions, 722 flow. Second operand 3 states and 1136 transitions. [2025-02-08 05:32:56,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 355 transitions, 750 flow [2025-02-08 05:32:56,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 355 transitions, 740 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:56,704 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 724 flow [2025-02-08 05:32:56,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=357, PETRI_TRANSITIONS=355} [2025-02-08 05:32:56,706 INFO L279 CegarLoopForPetriNet]: 381 programPoint places, -24 predicate places. [2025-02-08 05:32:56,706 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 724 flow [2025-02-08 05:32:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 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:32:56,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:56,707 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] [2025-02-08 05:32:56,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:56,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:32:56,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash 538794522, now seen corresponding path program 1 times [2025-02-08 05:32:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:56,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204286261] [2025-02-08 05:32:56,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:56,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 05:32:56,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 05:32:56,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:56,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:57,160 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:32:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204286261] [2025-02-08 05:32:57,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204286261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:57,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:57,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:57,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892378622] [2025-02-08 05:32:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:57,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:57,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:57,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:57,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 390 [2025-02-08 05:32:57,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 355 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 308.6666666666667) internal successors, (1852), 6 states have internal predecessors, (1852), 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:32:57,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:57,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 390 [2025-02-08 05:32:57,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:57,769 INFO L124 PetriNetUnfolderBase]: 448/1878 cut-off events. [2025-02-08 05:32:57,769 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:57,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2784 conditions, 1878 events. 448/1878 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10728 event pairs, 342 based on Foata normal form. 2/1677 useless extension candidates. Maximal degree in co-relation 2639. Up to 850 conditions per place. [2025-02-08 05:32:57,782 INFO L140 encePairwiseOnDemand]: 385/390 looper letters, 62 selfloop transitions, 0 changer transitions 14/354 dead transitions. [2025-02-08 05:32:57,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 354 transitions, 860 flow [2025-02-08 05:32:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1906 transitions. [2025-02-08 05:32:57,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8145299145299145 [2025-02-08 05:32:57,787 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 724 flow. Second operand 6 states and 1906 transitions. [2025-02-08 05:32:57,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 354 transitions, 860 flow [2025-02-08 05:32:57,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 354 transitions, 858 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:57,791 INFO L231 Difference]: Finished difference. Result has 360 places, 340 transitions, 692 flow [2025-02-08 05:32:57,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=360, PETRI_TRANSITIONS=340} [2025-02-08 05:32:57,792 INFO L279 CegarLoopForPetriNet]: 381 programPoint places, -21 predicate places. [2025-02-08 05:32:57,793 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 340 transitions, 692 flow [2025-02-08 05:32:57,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.6666666666667) internal successors, (1852), 6 states have internal predecessors, (1852), 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:32:57,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:57,794 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] [2025-02-08 05:32:57,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:32:57,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:32:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1911570048, now seen corresponding path program 1 times [2025-02-08 05:32:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:57,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269878745] [2025-02-08 05:32:57,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:57,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-08 05:32:57,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-08 05:32:57,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:57,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269878745] [2025-02-08 05:32:57,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269878745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:57,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780194745] [2025-02-08 05:32:57,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:57,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:57,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:57,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 390 [2025-02-08 05:32:57,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 340 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:32:57,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:57,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 390 [2025-02-08 05:32:57,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:57,893 INFO L124 PetriNetUnfolderBase]: 0/105 cut-off events. [2025-02-08 05:32:57,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:57,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 0/105 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/106 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-08 05:32:57,894 INFO L140 encePairwiseOnDemand]: 388/390 looper letters, 0 selfloop transitions, 0 changer transitions 105/105 dead transitions. [2025-02-08 05:32:57,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 216 flow [2025-02-08 05:32:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-02-08 05:32:57,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641025641025641 [2025-02-08 05:32:57,896 INFO L175 Difference]: Start difference. First operand has 360 places, 340 transitions, 692 flow. Second operand 3 states and 1128 transitions. [2025-02-08 05:32:57,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 216 flow [2025-02-08 05:32:57,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 105 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:57,897 INFO L231 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2025-02-08 05:32:57,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2025-02-08 05:32:57,898 INFO L279 CegarLoopForPetriNet]: 381 programPoint places, -271 predicate places. [2025-02-08 05:32:57,898 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2025-02-08 05:32:57,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-02-08 05:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-08 05:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-08 05:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-08 05:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-08 05:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-08 05:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-08 05:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-08 05:32:57,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-08 05:32:57,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-08 05:32:57,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-08 05:32:57,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-08 05:32:57,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-08 05:32:57,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2025-02-08 05:32:57,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 23 remaining) [2025-02-08 05:32:57,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-08 05:32:57,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-08 05:32:57,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-08 05:32:57,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-08 05:32:57,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-08 05:32:57,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-08 05:32:57,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-08 05:32:57,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-08 05:32:57,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:32:57,904 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:32:57,908 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:32:57,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:32:57,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:32:57 BasicIcfg [2025-02-08 05:32:57,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:32:57,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:32:57,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:32:57,914 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:32:57,923 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:53" (3/4) ... [2025-02-08 05:32:57,925 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:32:57,928 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f [2025-02-08 05:32:57,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 05:32:57,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:32:57,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:32:58,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:32:58,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:32:58,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:32:58,009 INFO L158 Benchmark]: Toolchain (without parser) took 6253.61ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 104.7MB in the beginning and 349.6MB in the end (delta: -244.9MB). Peak memory consumption was 233.0MB. Max. memory is 16.1GB. [2025-02-08 05:32:58,010 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:58,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.44ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 72.8MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:58,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.23ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 68.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:58,010 INFO L158 Benchmark]: Boogie Preprocessor took 41.81ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 65.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:58,011 INFO L158 Benchmark]: IcfgBuilder took 718.65ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 93.2MB in the end (delta: -28.1MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2025-02-08 05:32:58,011 INFO L158 Benchmark]: TraceAbstraction took 4845.22ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 92.5MB in the beginning and 128.6MB in the end (delta: -36.1MB). Peak memory consumption was 208.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:58,011 INFO L158 Benchmark]: Witness Printer took 94.86ms. Allocated memory is still 394.3MB. Free memory was 128.6MB in the beginning and 349.6MB in the end (delta: -221.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:58,012 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.44ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 72.8MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.23ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 68.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.81ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 65.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 718.65ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 93.2MB in the end (delta: -28.1MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4845.22ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 92.5MB in the beginning and 128.6MB in the end (delta: -36.1MB). Peak memory consumption was 208.6MB. Max. memory is 16.1GB. * Witness Printer took 94.86ms. Allocated memory is still 394.3MB. Free memory was 128.6MB in the beginning and 349.6MB in the end (delta: -221.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1037]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1040]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1040]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1041]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1006]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1007]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1026]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1011]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1006]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1026]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1007]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1059]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1059]: 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 4 procedures, 450 locations, 23 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.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1695 IncrementalHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 130 mSDtfsCounter, 1695 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=774occurred in iteration=1, 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, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:32:58,034 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