./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.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_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:58:02,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:58:02,402 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:02,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:58:02,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:58:02,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:58:02,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:58:02,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:58:02,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:58:02,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:58:02,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:58:02,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:58:02,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:58:02,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:58:02,422 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:58:02,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:58:02,422 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:58:02,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:58:02,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:58:02,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:02,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:58:02,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:58:02,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:58:02,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:58:02,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-02-06 12:58:02,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:58:02,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:58:02,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:58:02,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:58:02,817 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:58:02,822 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_71-funloop_racing.i [2025-02-06 12:58:04,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e57de8d6/8b44a1b632c744e29208d2a0f0db3fd1/FLAGbe6f5234d [2025-02-06 12:58:04,549 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:58:04,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-02-06 12:58:04,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e57de8d6/8b44a1b632c744e29208d2a0f0db3fd1/FLAGbe6f5234d [2025-02-06 12:58:04,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e57de8d6/8b44a1b632c744e29208d2a0f0db3fd1 [2025-02-06 12:58:04,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:58:04,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:58:04,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:04,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:58:04,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:58:04,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:04" (1/1) ... [2025-02-06 12:58:04,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a285505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:04, skipping insertion in model container [2025-02-06 12:58:04,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:04" (1/1) ... [2025-02-06 12:58:04,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:58:05,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:05,176 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:58:05,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:05,303 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:58:05,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05 WrapperNode [2025-02-06 12:58:05,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:05,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:05,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:58:05,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:58:05,317 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:05" (1/1) ... [2025-02-06 12:58:05,342 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:05" (1/1) ... [2025-02-06 12:58:05,375 INFO L138 Inliner]: procedures = 272, calls = 108, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 314 [2025-02-06 12:58:05,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:05,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:58:05,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:58:05,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:58:05,410 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:05" (1/1) ... [2025-02-06 12:58:05,410 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:05" (1/1) ... [2025-02-06 12:58:05,415 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:05" (1/1) ... [2025-02-06 12:58:05,442 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 75, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 7 writes are split as follows [0, 0, 6, 1]. [2025-02-06 12:58:05,446 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:05" (1/1) ... [2025-02-06 12:58:05,447 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:05" (1/1) ... [2025-02-06 12:58:05,468 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:05" (1/1) ... [2025-02-06 12:58:05,469 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:05" (1/1) ... [2025-02-06 12:58:05,474 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:05" (1/1) ... [2025-02-06 12:58:05,475 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:05" (1/1) ... [2025-02-06 12:58:05,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:58:05,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:58:05,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:58:05,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:58:05,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (1/1) ... [2025-02-06 12:58:05,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:05,536 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:05,541 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:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:58:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:58:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:58:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:58:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:58:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:58:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:58:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 12:58:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:58:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:58:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:58:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:58:05,558 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:05,694 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:58:05,697 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:58:06,305 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:06,305 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:06,377 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:58:06,377 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:58:06,810 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:58:06,810 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:58:06,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:06 BoogieIcfgContainer [2025-02-06 12:58:06,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:58:06,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:58:06,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:58:06,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:58:06,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:58:04" (1/3) ... [2025-02-06 12:58:06,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c780627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:06, skipping insertion in model container [2025-02-06 12:58:06,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:05" (2/3) ... [2025-02-06 12:58:06,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c780627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:06, skipping insertion in model container [2025-02-06 12:58:06,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:06" (3/3) ... [2025-02-06 12:58:06,817 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-02-06 12:58:06,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:58:06,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 162 locations, 1 initial locations, 20 loop locations, and 38 error locations. [2025-02-06 12:58:06,829 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:58:06,902 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 12:58:06,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 205 transitions, 417 flow [2025-02-06 12:58:07,049 INFO L124 PetriNetUnfolderBase]: 70/338 cut-off events. [2025-02-06 12:58:07,054 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:58:07,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 338 events. 70/338 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2033 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 198. Up to 8 conditions per place. [2025-02-06 12:58:07,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 205 transitions, 417 flow [2025-02-06 12:58:07,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 205 transitions, 417 flow [2025-02-06 12:58:07,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:07,085 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;@670b2cc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:07,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-06 12:58:07,124 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:07,128 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-02-06 12:58:07,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:07,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:07,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:58:07,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:07,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:07,152 INFO L85 PathProgramCache]: Analyzing trace with hash 26058935, now seen corresponding path program 1 times [2025-02-06 12:58:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:07,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609710415] [2025-02-06 12:58:07,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:07,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:58:07,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:58:07,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:07,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:07,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609710415] [2025-02-06 12:58:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609710415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154275848] [2025-02-06 12:58:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:07,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:07,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:07,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:07,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 205 [2025-02-06 12:58:07,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 205 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:07,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 205 [2025-02-06 12:58:07,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:07,999 INFO L124 PetriNetUnfolderBase]: 993/3509 cut-off events. [2025-02-06 12:58:07,999 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:58:08,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5389 conditions, 3509 events. 993/3509 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 31594 event pairs, 840 based on Foata normal form. 951/3954 useless extension candidates. Maximal degree in co-relation 5220. Up to 1874 conditions per place. [2025-02-06 12:58:08,017 INFO L140 encePairwiseOnDemand]: 166/205 looper letters, 68 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-02-06 12:58:08,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 167 transitions, 481 flow [2025-02-06 12:58:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2025-02-06 12:58:08,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6471544715447154 [2025-02-06 12:58:08,032 INFO L175 Difference]: Start difference. First operand has 165 places, 205 transitions, 417 flow. Second operand 3 states and 398 transitions. [2025-02-06 12:58:08,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 167 transitions, 481 flow [2025-02-06 12:58:08,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 167 transitions, 481 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:08,040 INFO L231 Difference]: Finished difference. Result has 165 places, 167 transitions, 351 flow [2025-02-06 12:58:08,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=165, PETRI_TRANSITIONS=167} [2025-02-06 12:58:08,045 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 0 predicate places. [2025-02-06 12:58:08,045 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 167 transitions, 351 flow [2025-02-06 12:58:08,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:08,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:58:08,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash 807685402, now seen corresponding path program 1 times [2025-02-06 12:58:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033476418] [2025-02-06 12:58:08,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:08,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:08,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:08,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:08,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:08,180 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:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033476418] [2025-02-06 12:58:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033476418] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769561016] [2025-02-06 12:58:08,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:08,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:08,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:08,183 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:08,185 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:08,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:08,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:08,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:08,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:08,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:58:08,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:08,285 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:08,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:08,301 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:08,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769561016] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:08,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:08,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 12:58:08,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570392905] [2025-02-06 12:58:08,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:08,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:58:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:08,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:58:08,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:58:08,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 205 [2025-02-06 12:58:08,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 167 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 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,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:08,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 205 [2025-02-06 12:58:08,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:08,756 INFO L124 PetriNetUnfolderBase]: 993/3512 cut-off events. [2025-02-06 12:58:08,756 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:58:08,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5405 conditions, 3512 events. 993/3512 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 31607 event pairs, 840 based on Foata normal form. 0/3006 useless extension candidates. Maximal degree in co-relation 5393. Up to 1874 conditions per place. [2025-02-06 12:58:08,772 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 68 selfloop transitions, 5 changer transitions 0/170 dead transitions. [2025-02-06 12:58:08,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 170 transitions, 509 flow [2025-02-06 12:58:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:58:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:58:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions. [2025-02-06 12:58:08,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5349593495934959 [2025-02-06 12:58:08,778 INFO L175 Difference]: Start difference. First operand has 165 places, 167 transitions, 351 flow. Second operand 6 states and 658 transitions. [2025-02-06 12:58:08,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 170 transitions, 509 flow [2025-02-06 12:58:08,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 170 transitions, 505 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:08,782 INFO L231 Difference]: Finished difference. Result has 172 places, 170 transitions, 383 flow [2025-02-06 12:58:08,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=172, PETRI_TRANSITIONS=170} [2025-02-06 12:58:08,783 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 7 predicate places. [2025-02-06 12:58:08,783 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 170 transitions, 383 flow [2025-02-06 12:58:08,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 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,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:08,784 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:08,791 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:08,988 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:08,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1208426871, now seen corresponding path program 2 times [2025-02-06 12:58:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656612166] [2025-02-06 12:58:08,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:09,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 12:58:09,005 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:09,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:09,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:09,073 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:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656612166] [2025-02-06 12:58:09,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656612166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:09,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:09,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316248215] [2025-02-06 12:58:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:09,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:09,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:09,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:09,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 205 [2025-02-06 12:58:09,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 170 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:09,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 205 [2025-02-06 12:58:09,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:09,500 INFO L124 PetriNetUnfolderBase]: 1046/3596 cut-off events. [2025-02-06 12:58:09,500 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 12:58:09,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5600 conditions, 3596 events. 1046/3596 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 32334 event pairs, 840 based on Foata normal form. 0/3127 useless extension candidates. Maximal degree in co-relation 5566. Up to 1870 conditions per place. [2025-02-06 12:58:09,536 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 95 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-02-06 12:58:09,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 190 transitions, 617 flow [2025-02-06 12:58:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-02-06 12:58:09,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608130081300813 [2025-02-06 12:58:09,539 INFO L175 Difference]: Start difference. First operand has 172 places, 170 transitions, 383 flow. Second operand 3 states and 374 transitions. [2025-02-06 12:58:09,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 190 transitions, 617 flow [2025-02-06 12:58:09,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 190 transitions, 603 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:09,546 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 369 flow [2025-02-06 12:58:09,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2025-02-06 12:58:09,547 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 6 predicate places. [2025-02-06 12:58:09,547 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 369 flow [2025-02-06 12:58:09,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:09,548 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:09,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:58:09,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:09,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1208426872, now seen corresponding path program 1 times [2025-02-06 12:58:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:09,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539353533] [2025-02-06 12:58:09,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:09,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:09,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:09,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:09,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:09,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:09,666 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:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539353533] [2025-02-06 12:58:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539353533] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796608445] [2025-02-06 12:58:09,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:09,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:09,670 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:09,673 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:09,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:09,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:09,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:09,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:09,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:58:09,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:09,769 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:09,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:09,826 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:09,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796608445] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:09,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:09,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 12:58:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254537308] [2025-02-06 12:58:09,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:09,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:58:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:09,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:58:09,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:58:09,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 205 [2025-02-06 12:58:09,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 369 flow. Second operand has 13 states, 13 states have (on average 98.15384615384616) internal successors, (1276), 13 states have internal predecessors, (1276), 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,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:09,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 205 [2025-02-06 12:58:09,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:10,212 INFO L124 PetriNetUnfolderBase]: 993/3494 cut-off events. [2025-02-06 12:58:10,212 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-02-06 12:58:10,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5445 conditions, 3494 events. 993/3494 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 31300 event pairs, 840 based on Foata normal form. 6/3019 useless extension candidates. Maximal degree in co-relation 5393. Up to 1874 conditions per place. [2025-02-06 12:58:10,228 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 68 selfloop transitions, 11 changer transitions 0/174 dead transitions. [2025-02-06 12:58:10,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 174 transitions, 563 flow [2025-02-06 12:58:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:58:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:58:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1249 transitions. [2025-02-06 12:58:10,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5077235772357723 [2025-02-06 12:58:10,232 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 369 flow. Second operand 12 states and 1249 transitions. [2025-02-06 12:58:10,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 174 transitions, 563 flow [2025-02-06 12:58:10,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 174 transitions, 559 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:10,236 INFO L231 Difference]: Finished difference. Result has 186 places, 174 transitions, 449 flow [2025-02-06 12:58:10,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=449, PETRI_PLACES=186, PETRI_TRANSITIONS=174} [2025-02-06 12:58:10,239 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 21 predicate places. [2025-02-06 12:58:10,239 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 174 transitions, 449 flow [2025-02-06 12:58:10,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.15384615384616) internal successors, (1276), 13 states have internal predecessors, (1276), 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,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:10,242 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-02-06 12:58:10,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:58:10,443 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:10,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:10,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash -192581992, now seen corresponding path program 2 times [2025-02-06 12:58:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:10,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281264409] [2025-02-06 12:58:10,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:10,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 12:58:10,468 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:10,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:10,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:10,543 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,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281264409] [2025-02-06 12:58:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281264409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130621771] [2025-02-06 12:58:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:10,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:10,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:10,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:10,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 205 [2025-02-06 12:58:10,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 174 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:10,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 205 [2025-02-06 12:58:10,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:10,937 INFO L124 PetriNetUnfolderBase]: 971/3331 cut-off events. [2025-02-06 12:58:10,937 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-06 12:58:10,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5263 conditions, 3331 events. 971/3331 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 30207 event pairs, 0 based on Foata normal form. 1/2924 useless extension candidates. Maximal degree in co-relation 5187. Up to 1843 conditions per place. [2025-02-06 12:58:10,951 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 101 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2025-02-06 12:58:10,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 197 transitions, 701 flow [2025-02-06 12:58:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-02-06 12:58:10,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227642276422765 [2025-02-06 12:58:10,953 INFO L175 Difference]: Start difference. First operand has 186 places, 174 transitions, 449 flow. Second operand 3 states and 383 transitions. [2025-02-06 12:58:10,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 197 transitions, 701 flow [2025-02-06 12:58:10,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 197 transitions, 653 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-02-06 12:58:10,957 INFO L231 Difference]: Finished difference. Result has 184 places, 174 transitions, 411 flow [2025-02-06 12:58:10,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=184, PETRI_TRANSITIONS=174} [2025-02-06 12:58:10,958 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 19 predicate places. [2025-02-06 12:58:10,958 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 174 transitions, 411 flow [2025-02-06 12:58:10,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:10,958 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:10,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:58:10,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:10,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:10,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1107622841, now seen corresponding path program 1 times [2025-02-06 12:58:10,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:10,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002648631] [2025-02-06 12:58:10,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:10,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:10,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:58:10,976 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,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:10,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:11,107 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:11,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:11,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002648631] [2025-02-06 12:58:11,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002648631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:11,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:58:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254964232] [2025-02-06 12:58:11,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:11,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:58:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:11,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:58:11,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:58:11,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 205 [2025-02-06 12:58:11,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 174 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:11,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:11,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 205 [2025-02-06 12:58:11,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:11,485 INFO L124 PetriNetUnfolderBase]: 951/3309 cut-off events. [2025-02-06 12:58:11,485 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-02-06 12:58:11,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5241 conditions, 3309 events. 951/3309 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 29955 event pairs, 17 based on Foata normal form. 22/2940 useless extension candidates. Maximal degree in co-relation 5188. Up to 1711 conditions per place. [2025-02-06 12:58:11,505 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 121 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2025-02-06 12:58:11,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 218 transitions, 745 flow [2025-02-06 12:58:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2025-02-06 12:58:11,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6085365853658536 [2025-02-06 12:58:11,507 INFO L175 Difference]: Start difference. First operand has 184 places, 174 transitions, 411 flow. Second operand 4 states and 499 transitions. [2025-02-06 12:58:11,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 218 transitions, 745 flow [2025-02-06 12:58:11,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 218 transitions, 741 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:11,511 INFO L231 Difference]: Finished difference. Result has 184 places, 173 transitions, 409 flow [2025-02-06 12:58:11,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=184, PETRI_TRANSITIONS=173} [2025-02-06 12:58:11,512 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 19 predicate places. [2025-02-06 12:58:11,513 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 173 transitions, 409 flow [2025-02-06 12:58:11,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:11,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:11,514 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 12:58:11,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:58:11,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:58:11,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash -23429456, now seen corresponding path program 1 times [2025-02-06 12:58:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:11,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665240171] [2025-02-06 12:58:11,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:11,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:11,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:58:11,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:58:11,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:11,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:11,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:58:11,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:58:11,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:58:11,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:11,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:11,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:58:11,586 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:58:11,586 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-02-06 12:58:11,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (44 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-02-06 12:58:11,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (31 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-02-06 12:58:11,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2025-02-06 12:58:11,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2025-02-06 12:58:11,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (22 of 50 remaining) [2025-02-06 12:58:11,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-02-06 12:58:11,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-02-06 12:58:11,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-02-06 12:58:11,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-02-06 12:58:11,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-02-06 12:58:11,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-02-06 12:58:11,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-02-06 12:58:11,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-02-06 12:58:11,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-02-06 12:58:11,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-02-06 12:58:11,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-02-06 12:58:11,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2025-02-06 12:58:11,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:58:11,592 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-02-06 12:58:11,594 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:58:11,594 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:58:11,655 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:58:11,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 271 transitions, 558 flow [2025-02-06 12:58:11,701 INFO L124 PetriNetUnfolderBase]: 113/549 cut-off events. [2025-02-06 12:58:11,701 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 12:58:11,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 549 events. 113/549 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3656 event pairs, 0 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 340. Up to 12 conditions per place. [2025-02-06 12:58:11,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 271 transitions, 558 flow [2025-02-06 12:58:11,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 218 places, 271 transitions, 558 flow [2025-02-06 12:58:11,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:11,710 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;@670b2cc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:11,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 12:58:11,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:11,711 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-02-06 12:58:11,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:11,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:11,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:58:11,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:11,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 34401399, now seen corresponding path program 1 times [2025-02-06 12:58:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:11,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679169981] [2025-02-06 12:58:11,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:11,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:58:11,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:58:11,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:11,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:11,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679169981] [2025-02-06 12:58:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679169981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:11,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594261806] [2025-02-06 12:58:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:11,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:11,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:11,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:11,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2025-02-06 12:58:11,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 271 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:58:11,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:11,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2025-02-06 12:58:11,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:18,144 INFO L124 PetriNetUnfolderBase]: 43639/99982 cut-off events. [2025-02-06 12:58:18,144 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-02-06 12:58:18,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163104 conditions, 99982 events. 43639/99982 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 2776. Compared 1237000 event pairs, 38368 based on Foata normal form. 31502/118383 useless extension candidates. Maximal degree in co-relation 150441. Up to 62979 conditions per place. [2025-02-06 12:58:18,814 INFO L140 encePairwiseOnDemand]: 220/271 looper letters, 92 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-02-06 12:58:18,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 220 transitions, 644 flow [2025-02-06 12:58:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2025-02-06 12:58:18,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6408364083640836 [2025-02-06 12:58:18,817 INFO L175 Difference]: Start difference. First operand has 218 places, 271 transitions, 558 flow. Second operand 3 states and 521 transitions. [2025-02-06 12:58:18,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 220 transitions, 644 flow [2025-02-06 12:58:18,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 220 transitions, 644 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:18,821 INFO L231 Difference]: Finished difference. Result has 217 places, 220 transitions, 466 flow [2025-02-06 12:58:18,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=217, PETRI_TRANSITIONS=220} [2025-02-06 12:58:18,823 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -1 predicate places. [2025-02-06 12:58:18,823 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 220 transitions, 466 flow [2025-02-06 12:58:18,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:18,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:18,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:18,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:58:18,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:18,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1066302057, now seen corresponding path program 1 times [2025-02-06 12:58:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:18,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609491924] [2025-02-06 12:58:18,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:18,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:18,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:18,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:18,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:18,859 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:18,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609491924] [2025-02-06 12:58:18,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609491924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614240618] [2025-02-06 12:58:18,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:18,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:18,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:18,880 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:18,884 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:18,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:19,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:19,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:19,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:19,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:58:19,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:19,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:19,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:19,042 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:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614240618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:19,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 12:58:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033272211] [2025-02-06 12:58:19,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:19,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:58:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:19,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:58:19,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:58:19,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2025-02-06 12:58:19,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 220 transitions, 466 flow. Second operand has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 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:19,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:19,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2025-02-06 12:58:19,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:25,146 INFO L124 PetriNetUnfolderBase]: 43639/99985 cut-off events. [2025-02-06 12:58:25,146 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-02-06 12:58:25,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163120 conditions, 99985 events. 43639/99985 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 2776. Compared 1237174 event pairs, 38368 based on Foata normal form. 0/86884 useless extension candidates. Maximal degree in co-relation 163107. Up to 62979 conditions per place. [2025-02-06 12:58:25,691 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 92 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2025-02-06 12:58:25,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 223 transitions, 672 flow [2025-02-06 12:58:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:58:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:58:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions. [2025-02-06 12:58:25,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5264452644526445 [2025-02-06 12:58:25,693 INFO L175 Difference]: Start difference. First operand has 217 places, 220 transitions, 466 flow. Second operand 6 states and 856 transitions. [2025-02-06 12:58:25,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 223 transitions, 672 flow [2025-02-06 12:58:25,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 223 transitions, 668 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:25,698 INFO L231 Difference]: Finished difference. Result has 224 places, 223 transitions, 498 flow [2025-02-06 12:58:25,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=224, PETRI_TRANSITIONS=223} [2025-02-06 12:58:25,699 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, 6 predicate places. [2025-02-06 12:58:25,699 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 223 transitions, 498 flow [2025-02-06 12:58:25,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 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:25,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:25,700 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:25,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:58:25,900 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:25,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:25,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash 486136055, now seen corresponding path program 2 times [2025-02-06 12:58:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577482649] [2025-02-06 12:58:25,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:25,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 12:58:25,911 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:25,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:25,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:25,932 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:25,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577482649] [2025-02-06 12:58:25,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577482649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:25,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:25,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:25,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713936154] [2025-02-06 12:58:25,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:25,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:25,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:25,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:25,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:25,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 271 [2025-02-06 12:58:25,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 223 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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:25,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:25,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 271 [2025-02-06 12:58:25,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:32,069 INFO L124 PetriNetUnfolderBase]: 46055/103549 cut-off events. [2025-02-06 12:58:32,069 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-02-06 12:58:32,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170112 conditions, 103549 events. 46055/103549 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 2919. Compared 1271960 event pairs, 38347 based on Foata normal form. 0/90728 useless extension candidates. Maximal degree in co-relation 170077. Up to 62893 conditions per place. [2025-02-06 12:58:32,684 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 141 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-02-06 12:58:32,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 265 transitions, 868 flow [2025-02-06 12:58:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2025-02-06 12:58:32,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236162361623616 [2025-02-06 12:58:32,690 INFO L175 Difference]: Start difference. First operand has 224 places, 223 transitions, 498 flow. Second operand 3 states and 507 transitions. [2025-02-06 12:58:32,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 265 transitions, 868 flow [2025-02-06 12:58:32,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 265 transitions, 854 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:32,697 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 484 flow [2025-02-06 12:58:32,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2025-02-06 12:58:32,703 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, 5 predicate places. [2025-02-06 12:58:32,704 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 484 flow [2025-02-06 12:58:32,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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:32,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:32,704 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:58:32,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:58:32,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:32,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:32,705 INFO L85 PathProgramCache]: Analyzing trace with hash 486136056, now seen corresponding path program 1 times [2025-02-06 12:58:32,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:32,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936461077] [2025-02-06 12:58:32,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:32,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:32,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:32,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:32,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:32,824 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:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936461077] [2025-02-06 12:58:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936461077] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:58:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843295519] [2025-02-06 12:58:32,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:32,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:58:32,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:32,846 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:32,861 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:33,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:33,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:33,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:33,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:33,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:58:33,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:58:33,057 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:33,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:58:33,106 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:33,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843295519] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:58:33,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:58:33,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 12:58:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632245238] [2025-02-06 12:58:33,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:58:33,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:58:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:33,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:58:33,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:58:33,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2025-02-06 12:58:33,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 484 flow. Second operand has 13 states, 13 states have (on average 127.15384615384616) internal successors, (1653), 13 states have internal predecessors, (1653), 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:33,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:33,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2025-02-06 12:58:33,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:39,367 INFO L124 PetriNetUnfolderBase]: 43639/99643 cut-off events. [2025-02-06 12:58:39,367 INFO L125 PetriNetUnfolderBase]: For 1253/1253 co-relation queries the response was YES. [2025-02-06 12:58:39,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163750 conditions, 99643 events. 43639/99643 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 2769. Compared 1229318 event pairs, 38368 based on Foata normal form. 6/86897 useless extension candidates. Maximal degree in co-relation 163697. Up to 62979 conditions per place. [2025-02-06 12:58:39,911 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 92 selfloop transitions, 11 changer transitions 0/227 dead transitions. [2025-02-06 12:58:39,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 726 flow [2025-02-06 12:58:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:58:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:58:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1621 transitions. [2025-02-06 12:58:39,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49846248462484627 [2025-02-06 12:58:39,914 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 484 flow. Second operand 12 states and 1621 transitions. [2025-02-06 12:58:39,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 726 flow [2025-02-06 12:58:39,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:39,961 INFO L231 Difference]: Finished difference. Result has 238 places, 227 transitions, 564 flow [2025-02-06 12:58:39,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=564, PETRI_PLACES=238, PETRI_TRANSITIONS=227} [2025-02-06 12:58:39,961 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, 20 predicate places. [2025-02-06 12:58:39,962 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 227 transitions, 564 flow [2025-02-06 12:58:39,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 127.15384615384616) internal successors, (1653), 13 states have internal predecessors, (1653), 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:39,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:39,963 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-02-06 12:58:39,969 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:40,163 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:40,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:58:40,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:40,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1320418376, now seen corresponding path program 2 times [2025-02-06 12:58:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:40,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167544248] [2025-02-06 12:58:40,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:40,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 12:58:40,180 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:40,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:40,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:40,229 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:40,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:40,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167544248] [2025-02-06 12:58:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167544248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:40,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11332864] [2025-02-06 12:58:40,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:40,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:40,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:40,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:40,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2025-02-06 12:58:40,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 227 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:40,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:40,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2025-02-06 12:58:40,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand