./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:57:58,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:57:58,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:57:58,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:57:58,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:57:58,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:57:58,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:57:58,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:57:58,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:57:58,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:57:58,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:57:58,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:57:58,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:57:58,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:57:58,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:57:58,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:57:58,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:57:58,068 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2025-02-06 12:57:58,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:57:58,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:57:58,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:57:58,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:57:58,363 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:57:58,363 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_60-invariant_racefree.i [2025-02-06 12:57:59,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/139d2c452/2b36d181e0794592b4fb75eafeb402cd/FLAG2ea0e3703 [2025-02-06 12:58:00,103 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:58:00,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-02-06 12:58:00,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/139d2c452/2b36d181e0794592b4fb75eafeb402cd/FLAG2ea0e3703 [2025-02-06 12:58:00,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/139d2c452/2b36d181e0794592b4fb75eafeb402cd [2025-02-06 12:58:00,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:58:00,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:58:00,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:00,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:58:00,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:58:00,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00, skipping insertion in model container [2025-02-06 12:58:00,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:58:00,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:00,451 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:58:00,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:00,511 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:58:00,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00 WrapperNode [2025-02-06 12:58:00,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:00,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:00,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:58:00,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:58:00,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,538 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 155 [2025-02-06 12:58:00,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:00,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:58:00,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:58:00,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:58:00,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,557 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-02-06 12:58:00,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:58:00,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:58:00,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:58:00,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:58:00,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (1/1) ... [2025-02-06 12:58:00,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:00,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:00,594 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-06 12:58:00,603 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-06 12:58:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:58:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:58:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:58:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:58:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:58:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:58:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:58:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 12:58:00,619 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:58:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:58:00,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:58:00,620 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:58:00,724 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:58:00,726 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:58:00,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 12:58:00,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 12:58:01,047 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:58:01,047 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:58:01,156 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:58:01,158 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:58:01,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:01 BoogieIcfgContainer [2025-02-06 12:58:01,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:58:01,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:58:01,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:58:01,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:58:01,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:58:00" (1/3) ... [2025-02-06 12:58:01,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c168a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:01, skipping insertion in model container [2025-02-06 12:58:01,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:00" (2/3) ... [2025-02-06 12:58:01,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c168a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:01, skipping insertion in model container [2025-02-06 12:58:01,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:01" (3/3) ... [2025-02-06 12:58:01,167 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2025-02-06 12:58:01,180 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:58:01,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_60-invariant_racefree.i that has 2 procedures, 82 locations, 1 initial locations, 10 loop locations, and 7 error locations. [2025-02-06 12:58:01,183 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:58:01,228 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 12:58:01,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 104 transitions, 215 flow [2025-02-06 12:58:01,303 INFO L124 PetriNetUnfolderBase]: 32/156 cut-off events. [2025-02-06 12:58:01,305 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:58:01,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 156 events. 32/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 702 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 99. Up to 6 conditions per place. [2025-02-06 12:58:01,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 104 transitions, 215 flow [2025-02-06 12:58:01,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 104 transitions, 215 flow [2025-02-06 12:58:01,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:01,324 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=None, 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;@defec70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:01,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 12:58:01,327 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:01,327 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:58:01,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:01,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:01,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:58:01,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:58:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash 412428, now seen corresponding path program 1 times [2025-02-06 12:58:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598944092] [2025-02-06 12:58:01,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:01,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:58:01,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:58:01,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:01,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:01,577 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-06 12:58:01,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:01,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598944092] [2025-02-06 12:58:01,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598944092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:01,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:01,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571207836] [2025-02-06 12:58:01,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:01,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:01,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:01,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:01,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:01,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 104 [2025-02-06 12:58:01,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-06 12:58:01,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:01,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 104 [2025-02-06 12:58:01,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:02,059 INFO L124 PetriNetUnfolderBase]: 338/1085 cut-off events. [2025-02-06 12:58:02,059 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:58:02,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1085 events. 338/1085 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6827 event pairs, 285 based on Foata normal form. 370/1407 useless extension candidates. Maximal degree in co-relation 1715. Up to 636 conditions per place. [2025-02-06 12:58:02,070 INFO L140 encePairwiseOnDemand]: 80/104 looper letters, 53 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2025-02-06 12:58:02,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 95 transitions, 307 flow [2025-02-06 12:58:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2025-02-06 12:58:02,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6634615384615384 [2025-02-06 12:58:02,084 INFO L175 Difference]: Start difference. First operand has 85 places, 104 transitions, 215 flow. Second operand 3 states and 207 transitions. [2025-02-06 12:58:02,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 95 transitions, 307 flow [2025-02-06 12:58:02,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 95 transitions, 307 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:02,093 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 171 flow [2025-02-06 12:58:02,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2025-02-06 12:58:02,098 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2025-02-06 12:58:02,098 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 171 flow [2025-02-06 12:58:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-06 12:58:02,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:02,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:58:02,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:58:02,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:58:02,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:02,100 INFO L85 PathProgramCache]: Analyzing trace with hash 412429, now seen corresponding path program 1 times [2025-02-06 12:58:02,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:02,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615524343] [2025-02-06 12:58:02,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:02,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:58:02,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:58:02,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:02,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:02,292 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-06 12:58:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615524343] [2025-02-06 12:58:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615524343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:02,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:02,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489668305] [2025-02-06 12:58:02,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:02,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:02,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:02,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:02,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 104 [2025-02-06 12:58:02,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-06 12:58:02,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:02,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 104 [2025-02-06 12:58:02,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:02,518 INFO L124 PetriNetUnfolderBase]: 321/1040 cut-off events. [2025-02-06 12:58:02,518 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:58:02,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1718 conditions, 1040 events. 321/1040 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6439 event pairs, 266 based on Foata normal form. 1/983 useless extension candidates. Maximal degree in co-relation 1685. Up to 636 conditions per place. [2025-02-06 12:58:02,524 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 53 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-02-06 12:58:02,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 96 transitions, 313 flow [2025-02-06 12:58:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-02-06 12:58:02,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2025-02-06 12:58:02,527 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 171 flow. Second operand 3 states and 186 transitions. [2025-02-06 12:58:02,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 96 transitions, 313 flow [2025-02-06 12:58:02,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:02,530 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 177 flow [2025-02-06 12:58:02,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2025-02-06 12:58:02,531 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, -1 predicate places. [2025-02-06 12:58:02,531 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 177 flow [2025-02-06 12:58:02,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-06 12:58:02,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:02,531 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:58:02,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:58:02,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:58:02,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1353174593, now seen corresponding path program 1 times [2025-02-06 12:58:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:02,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551515095] [2025-02-06 12:58:02,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:02,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:02,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:58:02,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:58:02,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:02,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:02,677 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-06 12:58:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551515095] [2025-02-06 12:58:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551515095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:58:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248803954] [2025-02-06 12:58:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:02,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:58:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:02,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:58:02,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:58:02,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 104 [2025-02-06 12:58:02,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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-06 12:58:02,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:02,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 104 [2025-02-06 12:58:02,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:02,788 INFO L124 PetriNetUnfolderBase]: 49/176 cut-off events. [2025-02-06 12:58:02,788 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-06 12:58:02,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 176 events. 49/176 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 647 event pairs, 28 based on Foata normal form. 32/202 useless extension candidates. Maximal degree in co-relation 307. Up to 93 conditions per place. [2025-02-06 12:58:02,789 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 35 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-02-06 12:58:02,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 200 flow [2025-02-06 12:58:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2025-02-06 12:58:02,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49759615384615385 [2025-02-06 12:58:02,791 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 177 flow. Second operand 4 states and 207 transitions. [2025-02-06 12:58:02,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 200 flow [2025-02-06 12:58:02,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 194 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:58:02,792 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 90 flow [2025-02-06 12:58:02,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-02-06 12:58:02,796 INFO L279 CegarLoopForPetriNet]: 85 programPoint places, -39 predicate places. [2025-02-06 12:58:02,796 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 90 flow [2025-02-06 12:58:02,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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-06 12:58:02,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:02,798 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 12:58:02,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:58:02,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 12:58:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1001260970, now seen corresponding path program 1 times [2025-02-06 12:58:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:02,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627549839] [2025-02-06 12:58:02,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:02,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:02,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:02,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:02,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:02,815 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:58:02,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:02,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:02,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:02,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:02,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:58:02,843 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:58:02,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-06 12:58:02,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-02-06 12:58:02,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-02-06 12:58:02,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-02-06 12:58:02,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-02-06 12:58:02,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-02-06 12:58:02,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-02-06 12:58:02,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-02-06 12:58:02,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-02-06 12:58:02,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:58:02,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 12:58:02,853 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:58:02,853 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:58:02,876 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:58:02,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 152 transitions, 320 flow [2025-02-06 12:58:02,904 INFO L124 PetriNetUnfolderBase]: 55/268 cut-off events. [2025-02-06 12:58:02,904 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 12:58:02,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 268 events. 55/268 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1347 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 160. Up to 9 conditions per place. [2025-02-06 12:58:02,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 152 transitions, 320 flow [2025-02-06 12:58:02,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 152 transitions, 320 flow [2025-02-06 12:58:02,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:02,911 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=None, 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;@defec70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:02,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 12:58:02,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:02,913 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:58:02,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:02,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:02,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:58:02,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:58:02,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash 563364, now seen corresponding path program 1 times [2025-02-06 12:58:02,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:02,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373357708] [2025-02-06 12:58:02,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:02,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:58:02,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:58:02,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:02,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:02,968 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-06 12:58:02,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:02,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373357708] [2025-02-06 12:58:02,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373357708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:02,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:02,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:02,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630750072] [2025-02-06 12:58:02,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:02,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:02,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:02,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:02,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:02,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 152 [2025-02-06 12:58:02,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 152 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-06 12:58:02,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:02,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 152 [2025-02-06 12:58:02,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:05,245 INFO L124 PetriNetUnfolderBase]: 11475/23842 cut-off events. [2025-02-06 12:58:05,247 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-06 12:58:05,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41265 conditions, 23842 events. 11475/23842 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 228449 event pairs, 9705 based on Foata normal form. 9616/32528 useless extension candidates. Maximal degree in co-relation 16620. Up to 15669 conditions per place. [2025-02-06 12:58:05,383 INFO L140 encePairwiseOnDemand]: 118/152 looper letters, 85 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-02-06 12:58:05,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 147 transitions, 484 flow [2025-02-06 12:58:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2025-02-06 12:58:05,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6995614035087719 [2025-02-06 12:58:05,386 INFO L175 Difference]: Start difference. First operand has 123 places, 152 transitions, 320 flow. Second operand 3 states and 319 transitions. [2025-02-06 12:58:05,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 147 transitions, 484 flow [2025-02-06 12:58:05,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:05,390 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 254 flow [2025-02-06 12:58:05,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-02-06 12:58:05,391 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2025-02-06 12:58:05,392 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 254 flow [2025-02-06 12:58:05,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-06 12:58:05,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:05,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:58:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:58:05,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:58:05,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash 563365, now seen corresponding path program 1 times [2025-02-06 12:58:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062331942] [2025-02-06 12:58:05,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:05,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:58:05,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:58:05,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:05,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:05,446 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-06 12:58:05,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:05,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062331942] [2025-02-06 12:58:05,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062331942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:05,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:05,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:05,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489449727] [2025-02-06 12:58:05,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:05,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:05,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:05,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:05,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:05,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 152 [2025-02-06 12:58:05,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-06 12:58:05,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:05,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 152 [2025-02-06 12:58:05,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:07,057 INFO L124 PetriNetUnfolderBase]: 10573/22699 cut-off events. [2025-02-06 12:58:07,058 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2025-02-06 12:58:07,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39288 conditions, 22699 events. 10573/22699 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 221897 event pairs, 4860 based on Foata normal form. 1/21626 useless extension candidates. Maximal degree in co-relation 35438. Up to 16193 conditions per place. [2025-02-06 12:58:07,148 INFO L140 encePairwiseOnDemand]: 148/152 looper letters, 71 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-02-06 12:58:07,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 134 transitions, 434 flow [2025-02-06 12:58:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-02-06 12:58:07,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-02-06 12:58:07,150 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 254 flow. Second operand 3 states and 264 transitions. [2025-02-06 12:58:07,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 134 transitions, 434 flow [2025-02-06 12:58:07,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 134 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:07,205 INFO L231 Difference]: Finished difference. Result has 121 places, 118 transitions, 264 flow [2025-02-06 12:58:07,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=121, PETRI_TRANSITIONS=118} [2025-02-06 12:58:07,211 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -2 predicate places. [2025-02-06 12:58:07,211 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 118 transitions, 264 flow [2025-02-06 12:58:07,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-06 12:58:07,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:07,211 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 12:58:07,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:58:07,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:58:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash 606487145, now seen corresponding path program 1 times [2025-02-06 12:58:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:07,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143104084] [2025-02-06 12:58:07,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:07,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:58:07,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:58:07,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:07,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:07,353 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-06 12:58:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143104084] [2025-02-06 12:58:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143104084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:07,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:07,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233383407] [2025-02-06 12:58:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:07,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:58:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:07,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:58:07,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:58:07,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 152 [2025-02-06 12:58:07,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-06 12:58:07,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:07,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 152 [2025-02-06 12:58:07,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:09,382 INFO L124 PetriNetUnfolderBase]: 10473/22348 cut-off events. [2025-02-06 12:58:09,382 INFO L125 PetriNetUnfolderBase]: For 707/707 co-relation queries the response was YES. [2025-02-06 12:58:09,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39486 conditions, 22348 events. 10473/22348 cut-off events. For 707/707 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 220195 event pairs, 255 based on Foata normal form. 16/21789 useless extension candidates. Maximal degree in co-relation 39357. Up to 15645 conditions per place. [2025-02-06 12:58:09,467 INFO L140 encePairwiseOnDemand]: 148/152 looper letters, 101 selfloop transitions, 4 changer transitions 0/166 dead transitions. [2025-02-06 12:58:09,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 166 transitions, 572 flow [2025-02-06 12:58:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2025-02-06 12:58:09,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888157894736842 [2025-02-06 12:58:09,469 INFO L175 Difference]: Start difference. First operand has 121 places, 118 transitions, 264 flow. Second operand 4 states and 358 transitions. [2025-02-06 12:58:09,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 166 transitions, 572 flow [2025-02-06 12:58:09,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 166 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:09,473 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 281 flow [2025-02-06 12:58:09,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2025-02-06 12:58:09,474 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 1 predicate places. [2025-02-06 12:58:09,474 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 281 flow [2025-02-06 12:58:09,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-06 12:58:09,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:09,474 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-06 12:58:09,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:58:09,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:58:09,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1242685068, now seen corresponding path program 1 times [2025-02-06 12:58:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903990726] [2025-02-06 12:58:09,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:09,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:58:09,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:58:09,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:09,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:09,626 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-06 12:58:09,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903990726] [2025-02-06 12:58:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903990726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:09,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:09,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:58:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048115089] [2025-02-06 12:58:09,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:09,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:58:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:09,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:58:09,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:58:09,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 152 [2025-02-06 12:58:09,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 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-06 12:58:09,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:09,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 152 [2025-02-06 12:58:09,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:10,882 INFO L124 PetriNetUnfolderBase]: 9754/21368 cut-off events. [2025-02-06 12:58:10,883 INFO L125 PetriNetUnfolderBase]: For 1492/1492 co-relation queries the response was YES. [2025-02-06 12:58:10,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38084 conditions, 21368 events. 9754/21368 cut-off events. For 1492/1492 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 212824 event pairs, 0 based on Foata normal form. 256/21182 useless extension candidates. Maximal degree in co-relation 2921. Up to 13216 conditions per place. [2025-02-06 12:58:11,159 INFO L140 encePairwiseOnDemand]: 148/152 looper letters, 129 selfloop transitions, 5 changer transitions 0/195 dead transitions. [2025-02-06 12:58:11,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 195 transitions, 697 flow [2025-02-06 12:58:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:58:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:58:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2025-02-06 12:58:11,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2025-02-06 12:58:11,161 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 281 flow. Second operand 5 states and 450 transitions. [2025-02-06 12:58:11,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 195 transitions, 697 flow [2025-02-06 12:58:11,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 195 transitions, 688 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:11,165 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 276 flow [2025-02-06 12:58:11,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2025-02-06 12:58:11,165 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 2 predicate places. [2025-02-06 12:58:11,165 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 276 flow [2025-02-06 12:58:11,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 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-06 12:58:11,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:11,166 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-02-06 12:58:11,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:58:11,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-06 12:58:11,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash -131467965, now seen corresponding path program 1 times [2025-02-06 12:58:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:11,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699099369] [2025-02-06 12:58:11,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:11,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:58:11,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:58:11,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:11,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:11,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:58:11,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:58:11,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:58:11,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:11,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:11,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:58:11,212 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:58:11,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 12:58:11,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-02-06 12:58:11,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-02-06 12:58:11,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2025-02-06 12:58:11,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-02-06 12:58:11,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 10 remaining) [2025-02-06 12:58:11,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-02-06 12:58:11,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2025-02-06 12:58:11,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2025-02-06 12:58:11,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-02-06 12:58:11,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:58:11,214 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 12:58:11,215 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:58:11,218 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:58:11,257 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 12:58:11,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 200 transitions, 427 flow [2025-02-06 12:58:11,281 INFO L124 PetriNetUnfolderBase]: 81/401 cut-off events. [2025-02-06 12:58:11,281 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 12:58:11,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 401 events. 81/401 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2155 event pairs, 1 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 279. Up to 12 conditions per place. [2025-02-06 12:58:11,283 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 200 transitions, 427 flow [2025-02-06 12:58:11,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 200 transitions, 427 flow [2025-02-06 12:58:11,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:11,289 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=None, 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;@defec70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:11,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 12:58:11,290 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:11,290 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:58:11,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:11,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:11,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:58:11,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 12:58:11,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash 761964, now seen corresponding path program 1 times [2025-02-06 12:58:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300140358] [2025-02-06 12:58:11,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:11,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:58:11,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:58:11,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:11,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:11,319 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-06 12:58:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300140358] [2025-02-06 12:58:11,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300140358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:11,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:11,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:11,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329211153] [2025-02-06 12:58:11,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:11,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:11,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:11,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:11,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:11,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2025-02-06 12:58:11,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 200 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-06 12:58:11,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:11,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2025-02-06 12:58:11,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand