./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_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_70-funloop_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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:58:01,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:58:01,661 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:58:01,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:58:01,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:58:01,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:58:01,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:58:01,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:58:01,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:58:01,696 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:58:01,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:58:01,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:58:01,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:58:01,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:58:01,697 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:58:01,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:58:01,698 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:58:01,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:58:01,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:58:01,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:58:01,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:58:01,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:01,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:58:01,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:58:01,700 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-02-06 12:58:01,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:58:01,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:58:01,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:58:01,992 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:58:01,992 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:58:01,994 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_70-funloop_racefree.i [2025-02-06 12:58:03,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04c438669/dc18686d069544b3bd126b41b8460229/FLAGc31428b68 [2025-02-06 12:58:03,700 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:58:03,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-02-06 12:58:03,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04c438669/dc18686d069544b3bd126b41b8460229/FLAGc31428b68 [2025-02-06 12:58:03,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04c438669/dc18686d069544b3bd126b41b8460229 [2025-02-06 12:58:03,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:58:03,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:58:03,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:03,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:58:03,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:58:03,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:03" (1/1) ... [2025-02-06 12:58:03,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6059ffbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:03, skipping insertion in model container [2025-02-06 12:58:03,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:03" (1/1) ... [2025-02-06 12:58:03,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:58:04,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:04,248 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:58:04,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:04,366 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:58:04,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:04 WrapperNode [2025-02-06 12:58:04,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:04,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:04,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:58:04,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:58:04,373 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:04" (1/1) ... [2025-02-06 12:58:04,398 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:04" (1/1) ... [2025-02-06 12:58:04,423 INFO L138 Inliner]: procedures = 272, calls = 96, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 256 [2025-02-06 12:58:04,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:04,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:58:04,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:58:04,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:58:04,433 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:04" (1/1) ... [2025-02-06 12:58:04,433 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:04" (1/1) ... [2025-02-06 12:58:04,438 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:04" (1/1) ... [2025-02-06 12:58:04,464 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-02-06 12:58:04,465 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:04" (1/1) ... [2025-02-06 12:58:04,465 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:04" (1/1) ... [2025-02-06 12:58:04,475 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:04" (1/1) ... [2025-02-06 12:58:04,480 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:04" (1/1) ... [2025-02-06 12:58:04,482 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:04" (1/1) ... [2025-02-06 12:58:04,483 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:04" (1/1) ... [2025-02-06 12:58:04,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:58:04,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:58:04,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:58:04,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:58:04,494 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:04" (1/1) ... [2025-02-06 12:58:04,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:04,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:04,524 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:04,529 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:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:58:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:58:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:58:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 12:58:04,552 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:58:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:58:04,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:58:04,555 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:04,728 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:58:04,730 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:58:05,204 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 12:58:05,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-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:05,292 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:58:05,292 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:58:05,667 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:58:05,667 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:58:05,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:05 BoogieIcfgContainer [2025-02-06 12:58:05,667 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:58:05,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:58:05,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:58:05,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:58:05,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:58:03" (1/3) ... [2025-02-06 12:58:05,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60598b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:05, skipping insertion in model container [2025-02-06 12:58:05,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:04" (2/3) ... [2025-02-06 12:58:05,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60598b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:05, skipping insertion in model container [2025-02-06 12:58:05,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:05" (3/3) ... [2025-02-06 12:58:05,680 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-02-06 12:58:05,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:58:05,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 117 locations, 1 initial locations, 15 loop locations, and 27 error locations. [2025-02-06 12:58:05,697 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:58:05,765 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 12:58:05,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 147 transitions, 301 flow [2025-02-06 12:58:05,890 INFO L124 PetriNetUnfolderBase]: 44/222 cut-off events. [2025-02-06 12:58:05,893 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:58:05,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 222 events. 44/222 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1093 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 140. Up to 8 conditions per place. [2025-02-06 12:58:05,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 147 transitions, 301 flow [2025-02-06 12:58:05,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 147 transitions, 301 flow [2025-02-06 12:58:05,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:05,932 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;@62063bb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:05,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-02-06 12:58:05,940 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:05,941 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-02-06 12:58:05,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:05,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:05,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:58:05,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-02-06 12:58:05,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash 20992356, now seen corresponding path program 1 times [2025-02-06 12:58:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:05,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000752756] [2025-02-06 12:58:05,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:06,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:58:06,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:58:06,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:06,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:06,245 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:06,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:06,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000752756] [2025-02-06 12:58:06,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000752756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:06,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:06,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138781308] [2025-02-06 12:58:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:06,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:06,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:06,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:06,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 147 [2025-02-06 12:58:06,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 147 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:06,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:06,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 147 [2025-02-06 12:58:06,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:06,762 INFO L124 PetriNetUnfolderBase]: 625/2148 cut-off events. [2025-02-06 12:58:06,763 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:58:06,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3341 conditions, 2148 events. 625/2148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 16695 event pairs, 525 based on Foata normal form. 537/2369 useless extension candidates. Maximal degree in co-relation 3233. Up to 1187 conditions per place. [2025-02-06 12:58:06,787 INFO L140 encePairwiseOnDemand]: 120/147 looper letters, 53 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-02-06 12:58:06,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 361 flow [2025-02-06 12:58:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-02-06 12:58:06,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63718820861678 [2025-02-06 12:58:06,804 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 301 flow. Second operand 3 states and 281 transitions. [2025-02-06 12:58:06,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 361 flow [2025-02-06 12:58:06,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 122 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:06,813 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 261 flow [2025-02-06 12:58:06,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2025-02-06 12:58:06,822 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2025-02-06 12:58:06,822 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 261 flow [2025-02-06 12:58:06,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:06,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:06,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:06,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:58:06,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-02-06 12:58:06,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:06,826 INFO L85 PathProgramCache]: Analyzing trace with hash 650654932, now seen corresponding path program 1 times [2025-02-06 12:58:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939485643] [2025-02-06 12:58:06,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:06,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:06,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:06,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:06,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:07,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939485643] [2025-02-06 12:58:07,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939485643] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:07,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046117935] [2025-02-06 12:58:07,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:07,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:07,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:07,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:58:07,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:58:07,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:07,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:07,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:07,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:07,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:58:07,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:07,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046117935] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:07,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 12:58:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957921786] [2025-02-06 12:58:07,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:07,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:58:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:07,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:58:07,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:58:07,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 147 [2025-02-06 12:58:07,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 68.28571428571429) internal successors, (478), 7 states have internal predecessors, (478), 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,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:07,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 147 [2025-02-06 12:58:07,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:07,634 INFO L124 PetriNetUnfolderBase]: 625/2151 cut-off events. [2025-02-06 12:58:07,634 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:58:07,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3357 conditions, 2151 events. 625/2151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 16709 event pairs, 525 based on Foata normal form. 0/1835 useless extension candidates. Maximal degree in co-relation 3345. Up to 1187 conditions per place. [2025-02-06 12:58:07,648 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 53 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2025-02-06 12:58:07,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 389 flow [2025-02-06 12:58:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:58:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:58:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 463 transitions. [2025-02-06 12:58:07,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5249433106575964 [2025-02-06 12:58:07,652 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 261 flow. Second operand 6 states and 463 transitions. [2025-02-06 12:58:07,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 389 flow [2025-02-06 12:58:07,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 385 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:07,659 INFO L231 Difference]: Finished difference. Result has 128 places, 125 transitions, 293 flow [2025-02-06 12:58:07,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=128, PETRI_TRANSITIONS=125} [2025-02-06 12:58:07,662 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 8 predicate places. [2025-02-06 12:58:07,662 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 293 flow [2025-02-06 12:58:07,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.28571428571429) internal successors, (478), 7 states have internal predecessors, (478), 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,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:07,663 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:07,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:58:07,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:07,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-02-06 12:58:07,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash 366325092, now seen corresponding path program 2 times [2025-02-06 12:58:07,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:07,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859131173] [2025-02-06 12:58:07,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:07,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 12:58:07,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-02-06 12:58:07,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:07,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 12:58:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859131173] [2025-02-06 12:58:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859131173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:07,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:07,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172404740] [2025-02-06 12:58:07,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:07,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:07,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:07,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:07,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:08,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 147 [2025-02-06 12:58:08,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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:08,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:08,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 147 [2025-02-06 12:58:08,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:08,406 INFO L124 PetriNetUnfolderBase]: 669/2254 cut-off events. [2025-02-06 12:58:08,406 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 12:58:08,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3563 conditions, 2254 events. 669/2254 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 17767 event pairs, 525 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 3529. Up to 1184 conditions per place. [2025-02-06 12:58:08,423 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 80 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-02-06 12:58:08,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 145 transitions, 497 flow [2025-02-06 12:58:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2025-02-06 12:58:08,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6099773242630385 [2025-02-06 12:58:08,427 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 293 flow. Second operand 3 states and 269 transitions. [2025-02-06 12:58:08,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 145 transitions, 497 flow [2025-02-06 12:58:08,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 483 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:08,432 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 279 flow [2025-02-06 12:58:08,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-02-06 12:58:08,435 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 7 predicate places. [2025-02-06 12:58:08,435 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 279 flow [2025-02-06 12:58:08,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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:08,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:08,435 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:08,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:58:08,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-02-06 12:58:08,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 366325093, now seen corresponding path program 1 times [2025-02-06 12:58:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394996041] [2025-02-06 12:58:08,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:08,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:08,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:08,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:08,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:08,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394996041] [2025-02-06 12:58:08,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394996041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549230464] [2025-02-06 12:58:08,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:08,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:58:08,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:58:08,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:08,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:08,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:08,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:58:08,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:08,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:08,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549230464] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:08,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:08,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 12:58:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654890647] [2025-02-06 12:58:08,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:08,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:58:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:08,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:58:08,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:58:08,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 147 [2025-02-06 12:58:08,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 279 flow. Second operand has 13 states, 13 states have (on average 68.15384615384616) internal successors, (886), 13 states have internal predecessors, (886), 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:08,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:08,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 147 [2025-02-06 12:58:08,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:09,252 INFO L124 PetriNetUnfolderBase]: 625/2153 cut-off events. [2025-02-06 12:58:09,252 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-02-06 12:58:09,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3408 conditions, 2153 events. 625/2153 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 16656 event pairs, 525 based on Foata normal form. 6/1848 useless extension candidates. Maximal degree in co-relation 3356. Up to 1187 conditions per place. [2025-02-06 12:58:09,268 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 53 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2025-02-06 12:58:09,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 129 transitions, 443 flow [2025-02-06 12:58:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:58:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:58:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 874 transitions. [2025-02-06 12:58:09,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954648526077097 [2025-02-06 12:58:09,272 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 279 flow. Second operand 12 states and 874 transitions. [2025-02-06 12:58:09,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 129 transitions, 443 flow [2025-02-06 12:58:09,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 129 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:09,277 INFO L231 Difference]: Finished difference. Result has 142 places, 129 transitions, 359 flow [2025-02-06 12:58:09,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=359, PETRI_PLACES=142, PETRI_TRANSITIONS=129} [2025-02-06 12:58:09,281 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 22 predicate places. [2025-02-06 12:58:09,282 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 129 transitions, 359 flow [2025-02-06 12:58:09,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 68.15384615384616) internal successors, (886), 13 states have internal predecessors, (886), 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,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:09,282 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-02-06 12:58:09,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:58:09,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:09,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-02-06 12:58:09,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1158379365, now seen corresponding path program 2 times [2025-02-06 12:58:09,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:09,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508380662] [2025-02-06 12:58:09,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:09,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:09,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 12:58:09,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-02-06 12:58:09,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:09,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:58:09,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508380662] [2025-02-06 12:58:09,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508380662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:09,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:09,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855205268] [2025-02-06 12:58:09,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:09,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:09,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:09,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:09,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 147 [2025-02-06 12:58:09,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 129 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:09,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 147 [2025-02-06 12:58:09,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:09,957 INFO L124 PetriNetUnfolderBase]: 645/2201 cut-off events. [2025-02-06 12:58:09,957 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-06 12:58:09,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3482 conditions, 2201 events. 645/2201 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 17106 event pairs, 425 based on Foata normal form. 1/1899 useless extension candidates. Maximal degree in co-relation 3406. Up to 1192 conditions per place. [2025-02-06 12:58:09,973 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 86 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-02-06 12:58:09,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 152 transitions, 581 flow [2025-02-06 12:58:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-02-06 12:58:09,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303854875283447 [2025-02-06 12:58:09,975 INFO L175 Difference]: Start difference. First operand has 142 places, 129 transitions, 359 flow. Second operand 3 states and 278 transitions. [2025-02-06 12:58:09,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 152 transitions, 581 flow [2025-02-06 12:58:09,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 152 transitions, 533 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-02-06 12:58:09,982 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 321 flow [2025-02-06 12:58:09,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-02-06 12:58:09,984 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 20 predicate places. [2025-02-06 12:58:09,985 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 321 flow [2025-02-06 12:58:09,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:09,985 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:09,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:58:09,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-02-06 12:58:09,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1530974078, now seen corresponding path program 1 times [2025-02-06 12:58:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041546238] [2025-02-06 12:58:09,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:09,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:58:10,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:58:10,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:10,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:58:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041546238] [2025-02-06 12:58:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041546238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:10,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:10,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:58:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382433115] [2025-02-06 12:58:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:58:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:10,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:58:10,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:58:10,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 147 [2025-02-06 12:58:10,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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:10,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:10,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 147 [2025-02-06 12:58:10,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:10,580 INFO L124 PetriNetUnfolderBase]: 597/1967 cut-off events. [2025-02-06 12:58:10,580 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-02-06 12:58:10,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 1967 events. 597/1967 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 15386 event pairs, 0 based on Foata normal form. 22/1748 useless extension candidates. Maximal degree in co-relation 3186. Up to 1051 conditions per place. [2025-02-06 12:58:10,597 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 106 selfloop transitions, 3 changer transitions 0/173 dead transitions. [2025-02-06 12:58:10,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 173 transitions, 625 flow [2025-02-06 12:58:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2025-02-06 12:58:10,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-02-06 12:58:10,602 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 321 flow. Second operand 4 states and 364 transitions. [2025-02-06 12:58:10,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 173 transitions, 625 flow [2025-02-06 12:58:10,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 173 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:10,609 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 319 flow [2025-02-06 12:58:10,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2025-02-06 12:58:10,610 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 20 predicate places. [2025-02-06 12:58:10,611 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 319 flow [2025-02-06 12:58:10,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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:10,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:10,611 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 12:58:10,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:58:10,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-02-06 12:58:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash 215556833, now seen corresponding path program 1 times [2025-02-06 12:58:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:10,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528120969] [2025-02-06 12:58:10,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:10,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:58:10,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:58:10,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:10,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:10,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:58:10,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:58:10,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:58:10,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:10,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:10,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:58:10,698 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:58:10,699 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (33 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 39 remaining) [2025-02-06 12:58:10,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (22 of 39 remaining) [2025-02-06 12:58:10,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 39 remaining) [2025-02-06 12:58:10,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 39 remaining) [2025-02-06 12:58:10,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 39 remaining) [2025-02-06 12:58:10,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 39 remaining) [2025-02-06 12:58:10,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 39 remaining) [2025-02-06 12:58:10,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 39 remaining) [2025-02-06 12:58:10,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 39 remaining) [2025-02-06 12:58:10,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 39 remaining) [2025-02-06 12:58:10,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 39 remaining) [2025-02-06 12:58:10,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 39 remaining) [2025-02-06 12:58:10,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 39 remaining) [2025-02-06 12:58:10,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 39 remaining) [2025-02-06 12:58:10,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 39 remaining) [2025-02-06 12:58:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:58:10,707 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-02-06 12:58:10,710 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:58:10,711 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:58:10,752 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:58:10,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 213 transitions, 442 flow [2025-02-06 12:58:10,784 INFO L124 PetriNetUnfolderBase]: 74/375 cut-off events. [2025-02-06 12:58:10,784 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 12:58:10,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 375 events. 74/375 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2195 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 224. Up to 12 conditions per place. [2025-02-06 12:58:10,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 213 transitions, 442 flow [2025-02-06 12:58:10,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 213 transitions, 442 flow [2025-02-06 12:58:10,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:10,794 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;@62063bb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:10,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-06 12:58:10,796 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:10,796 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-02-06 12:58:10,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:10,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:10,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:58:10,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:10,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash 27549348, now seen corresponding path program 1 times [2025-02-06 12:58:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812283238] [2025-02-06 12:58:10,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:10,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:10,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:58:10,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:58:10,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:10,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:10,828 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:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812283238] [2025-02-06 12:58:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812283238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:10,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789103777] [2025-02-06 12:58:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:10,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:10,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:10,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2025-02-06 12:58:10,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 213 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:10,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:10,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2025-02-06 12:58:10,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:16,239 INFO L124 PetriNetUnfolderBase]: 27581/62401 cut-off events. [2025-02-06 12:58:16,239 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-02-06 12:58:16,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102390 conditions, 62401 events. 27581/62401 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 710645 event pairs, 24192 based on Foata normal form. 18397/72329 useless extension candidates. Maximal degree in co-relation 98765. Up to 39871 conditions per place. [2025-02-06 12:58:16,715 INFO L140 encePairwiseOnDemand]: 174/213 looper letters, 77 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2025-02-06 12:58:16,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 175 transitions, 524 flow [2025-02-06 12:58:16,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2025-02-06 12:58:16,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6322378716744914 [2025-02-06 12:58:16,718 INFO L175 Difference]: Start difference. First operand has 173 places, 213 transitions, 442 flow. Second operand 3 states and 404 transitions. [2025-02-06 12:58:16,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 175 transitions, 524 flow [2025-02-06 12:58:16,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 175 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:16,722 INFO L231 Difference]: Finished difference. Result has 173 places, 175 transitions, 376 flow [2025-02-06 12:58:16,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=173, PETRI_TRANSITIONS=175} [2025-02-06 12:58:16,724 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 0 predicate places. [2025-02-06 12:58:16,724 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 175 transitions, 376 flow [2025-02-06 12:58:16,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:16,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:16,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:16,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:58:16,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:16,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash 853921897, now seen corresponding path program 1 times [2025-02-06 12:58:16,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:16,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980346892] [2025-02-06 12:58:16,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:16,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:16,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:16,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:16,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:16,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980346892] [2025-02-06 12:58:16,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980346892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:16,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196619587] [2025-02-06 12:58:16,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:16,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:16,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:16,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:58:16,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:58:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:16,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:16,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:16,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:16,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:58:16,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:16,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196619587] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:16,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 12:58:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883928031] [2025-02-06 12:58:16,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:16,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:58:16,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:16,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:58:16,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:58:16,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2025-02-06 12:58:16,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 175 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 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:16,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:16,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2025-02-06 12:58:16,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:20,888 INFO L124 PetriNetUnfolderBase]: 27581/62404 cut-off events. [2025-02-06 12:58:20,888 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-02-06 12:58:21,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102406 conditions, 62404 events. 27581/62404 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 710705 event pairs, 24192 based on Foata normal form. 0/53935 useless extension candidates. Maximal degree in co-relation 102393. Up to 39871 conditions per place. [2025-02-06 12:58:21,325 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 77 selfloop transitions, 5 changer transitions 0/178 dead transitions. [2025-02-06 12:58:21,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 178 transitions, 552 flow [2025-02-06 12:58:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:58:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:58:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 661 transitions. [2025-02-06 12:58:21,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5172143974960877 [2025-02-06 12:58:21,329 INFO L175 Difference]: Start difference. First operand has 173 places, 175 transitions, 376 flow. Second operand 6 states and 661 transitions. [2025-02-06 12:58:21,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 178 transitions, 552 flow [2025-02-06 12:58:21,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 178 transitions, 548 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:21,333 INFO L231 Difference]: Finished difference. Result has 180 places, 178 transitions, 408 flow [2025-02-06 12:58:21,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=180, PETRI_TRANSITIONS=178} [2025-02-06 12:58:21,335 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 7 predicate places. [2025-02-06 12:58:21,335 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 178 transitions, 408 flow [2025-02-06 12:58:21,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 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:21,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:21,336 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:21,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:58:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:21,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:21,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash -11196444, now seen corresponding path program 2 times [2025-02-06 12:58:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401426951] [2025-02-06 12:58:21,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:21,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 12:58:21,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-02-06 12:58:21,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:21,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 12:58:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401426951] [2025-02-06 12:58:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401426951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:21,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:21,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293015610] [2025-02-06 12:58:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:21,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:21,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:21,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:21,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 213 [2025-02-06 12:58:21,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 178 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:21,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:21,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 213 [2025-02-06 12:58:21,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:25,916 INFO L124 PetriNetUnfolderBase]: 29604/65944 cut-off events. [2025-02-06 12:58:25,917 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2025-02-06 12:58:26,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109019 conditions, 65944 events. 29604/65944 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 1727. Compared 750743 event pairs, 24171 based on Foata normal form. 0/57198 useless extension candidates. Maximal degree in co-relation 108984. Up to 39824 conditions per place. [2025-02-06 12:58:26,314 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 126 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-02-06 12:58:26,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 220 transitions, 748 flow [2025-02-06 12:58:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2025-02-06 12:58:26,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6291079812206573 [2025-02-06 12:58:26,317 INFO L175 Difference]: Start difference. First operand has 180 places, 178 transitions, 408 flow. Second operand 3 states and 402 transitions. [2025-02-06 12:58:26,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 220 transitions, 748 flow [2025-02-06 12:58:26,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 220 transitions, 734 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:26,323 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 394 flow [2025-02-06 12:58:26,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=179, PETRI_TRANSITIONS=176} [2025-02-06 12:58:26,324 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 6 predicate places. [2025-02-06 12:58:26,325 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 394 flow [2025-02-06 12:58:26,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:26,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:26,326 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:26,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:58:26,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:26,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash -11196443, now seen corresponding path program 1 times [2025-02-06 12:58:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465560069] [2025-02-06 12:58:26,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:26,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:26,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:26,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:26,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:26,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:26,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465560069] [2025-02-06 12:58:26,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465560069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:26,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367351753] [2025-02-06 12:58:26,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:26,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:26,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:26,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:58:26,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:58:26,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:26,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:26,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:26,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:26,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:58:26,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:26,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:26,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367351753] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:26,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:26,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 12:58:26,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818085717] [2025-02-06 12:58:26,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:26,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:58:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:26,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:58:26,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:58:26,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2025-02-06 12:58:26,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 394 flow. Second operand has 13 states, 13 states have (on average 97.15384615384616) internal successors, (1263), 13 states have internal predecessors, (1263), 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:26,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:26,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2025-02-06 12:58:26,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:30,962 INFO L124 PetriNetUnfolderBase]: 27581/62398 cut-off events. [2025-02-06 12:58:30,962 INFO L125 PetriNetUnfolderBase]: For 757/757 co-relation queries the response was YES. [2025-02-06 12:58:31,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102955 conditions, 62398 events. 27581/62398 cut-off events. For 757/757 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 710547 event pairs, 24192 based on Foata normal form. 6/53948 useless extension candidates. Maximal degree in co-relation 102902. Up to 39871 conditions per place. [2025-02-06 12:58:31,265 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 77 selfloop transitions, 11 changer transitions 0/182 dead transitions. [2025-02-06 12:58:31,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 182 transitions, 606 flow [2025-02-06 12:58:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:58:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:58:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1246 transitions. [2025-02-06 12:58:31,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4874804381846635 [2025-02-06 12:58:31,269 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 394 flow. Second operand 12 states and 1246 transitions. [2025-02-06 12:58:31,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 182 transitions, 606 flow [2025-02-06 12:58:31,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 182 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:31,274 INFO L231 Difference]: Finished difference. Result has 194 places, 182 transitions, 474 flow [2025-02-06 12:58:31,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=474, PETRI_PLACES=194, PETRI_TRANSITIONS=182} [2025-02-06 12:58:31,275 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 21 predicate places. [2025-02-06 12:58:31,275 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 182 transitions, 474 flow [2025-02-06 12:58:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 97.15384615384616) internal successors, (1263), 13 states have internal predecessors, (1263), 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:31,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:31,276 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-02-06 12:58:31,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:58:31,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 12:58:31,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:31,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1983572421, now seen corresponding path program 2 times [2025-02-06 12:58:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:31,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285068049] [2025-02-06 12:58:31,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:31,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 12:58:31,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-02-06 12:58:31,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:31,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:58:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:31,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285068049] [2025-02-06 12:58:31,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285068049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:31,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:31,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:31,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140304609] [2025-02-06 12:58:31,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:31,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:31,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:31,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:31,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 213 [2025-02-06 12:58:31,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 182 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:31,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:31,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 213 [2025-02-06 12:58:31,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:35,793 INFO L124 PetriNetUnfolderBase]: 28613/65355 cut-off events. [2025-02-06 12:58:35,794 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-02-06 12:58:36,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106869 conditions, 65355 events. 28613/65355 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 1690. Compared 752558 event pairs, 22636 based on Foata normal form. 1/56492 useless extension candidates. Maximal degree in co-relation 106792. Up to 41313 conditions per place. [2025-02-06 12:58:36,207 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 111 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2025-02-06 12:58:36,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 206 transitions, 748 flow [2025-02-06 12:58:36,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2025-02-06 12:58:36,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6103286384976526 [2025-02-06 12:58:36,208 INFO L175 Difference]: Start difference. First operand has 194 places, 182 transitions, 474 flow. Second operand 3 states and 390 transitions. [2025-02-06 12:58:36,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 206 transitions, 748 flow [2025-02-06 12:58:36,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 206 transitions, 700 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-02-06 12:58:36,212 INFO L231 Difference]: Finished difference. Result has 192 places, 183 transitions, 440 flow [2025-02-06 12:58:36,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=192, PETRI_TRANSITIONS=183} [2025-02-06 12:58:36,213 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 19 predicate places. [2025-02-06 12:58:36,213 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 183 transitions, 440 flow [2025-02-06 12:58:36,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:36,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:36,214 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:36,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:58:36,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:36,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1456392482, now seen corresponding path program 1 times [2025-02-06 12:58:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:36,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235862289] [2025-02-06 12:58:36,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:36,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:36,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:58:36,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:58:36,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:36,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:58:36,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235862289] [2025-02-06 12:58:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235862289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:58:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435587457] [2025-02-06 12:58:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:36,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:58:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:36,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:58:36,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:58:36,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 213 [2025-02-06 12:58:36,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 183 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 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:36,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:36,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 213 [2025-02-06 12:58:36,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:40,855 INFO L124 PetriNetUnfolderBase]: 27613/61902 cut-off events. [2025-02-06 12:58:40,855 INFO L125 PetriNetUnfolderBase]: For 1279/1279 co-relation queries the response was YES. [2025-02-06 12:58:41,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103557 conditions, 61902 events. 27613/61902 cut-off events. For 1279/1279 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 707021 event pairs, 6473 based on Foata normal form. 528/54784 useless extension candidates. Maximal degree in co-relation 103503. Up to 34941 conditions per place. [2025-02-06 12:58:41,306 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 198 selfloop transitions, 5 changer transitions 0/295 dead transitions. [2025-02-06 12:58:41,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 295 transitions, 1068 flow [2025-02-06 12:58:41,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:58:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:58:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2025-02-06 12:58:41,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6244131455399061 [2025-02-06 12:58:41,308 INFO L175 Difference]: Start difference. First operand has 192 places, 183 transitions, 440 flow. Second operand 5 states and 665 transitions. [2025-02-06 12:58:41,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 295 transitions, 1068 flow [2025-02-06 12:58:41,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 295 transitions, 1066 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:41,315 INFO L231 Difference]: Finished difference. Result has 195 places, 183 transitions, 451 flow [2025-02-06 12:58:41,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=451, PETRI_PLACES=195, PETRI_TRANSITIONS=183} [2025-02-06 12:58:41,316 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 22 predicate places. [2025-02-06 12:58:41,316 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 183 transitions, 451 flow [2025-02-06 12:58:41,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 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:41,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:41,317 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 12:58:41,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:58:41,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1134475934, now seen corresponding path program 1 times [2025-02-06 12:58:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:41,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881645398] [2025-02-06 12:58:41,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:41,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:41,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:58:41,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:58:41,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:41,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:41,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:58:41,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:58:41,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:58:41,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:41,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:41,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:58:41,371 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:58:41,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-02-06 12:58:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-02-06 12:58:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-02-06 12:58:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-02-06 12:58:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-02-06 12:58:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (44 of 50 remaining) [2025-02-06 12:58:41,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (33 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-02-06 12:58:41,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (22 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-02-06 12:58:41,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-02-06 12:58:41,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-02-06 12:58:41,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-02-06 12:58:41,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-02-06 12:58:41,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-02-06 12:58:41,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-02-06 12:58:41,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-02-06 12:58:41,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2025-02-06 12:58:41,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:58:41,374 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-02-06 12:58:41,375 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:58:41,375 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:58:41,425 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 12:58:41,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 279 transitions, 585 flow [2025-02-06 12:58:41,492 INFO L124 PetriNetUnfolderBase]: 107/549 cut-off events. [2025-02-06 12:58:41,493 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 12:58:41,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 549 events. 107/549 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3447 event pairs, 1 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 384. Up to 16 conditions per place. [2025-02-06 12:58:41,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 279 transitions, 585 flow [2025-02-06 12:58:41,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 279 transitions, 585 flow [2025-02-06 12:58:41,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:41,509 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;@62063bb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:41,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 12:58:41,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:41,512 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-02-06 12:58:41,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:41,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:41,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:58:41,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:41,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash 36138084, now seen corresponding path program 1 times [2025-02-06 12:58:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:41,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073193590] [2025-02-06 12:58:41,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:41,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:58:41,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:58:41,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:41,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:41,548 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:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:41,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073193590] [2025-02-06 12:58:41,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073193590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:41,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:41,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520789618] [2025-02-06 12:58:41,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:41,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:41,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:41,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:41,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2025-02-06 12:58:41,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 279 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:41,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:41,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2025-02-06 12:58:41,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand