./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/list-simple/sll2c_remove_all_reverse.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 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:42:50,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:42:50,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:42:50,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:42:50,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:42:50,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:42:50,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:42:50,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:42:50,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:42:50,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:42:50,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:42:50,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:42:50,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:42:50,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:42:50,904 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:42:50,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:42:50,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:42:50,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:42:50,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:42:50,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:42:50,905 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:42:50,905 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:42:50,905 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:42:50,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:42:50,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:42:50,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:42:50,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:42:50,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:42:50,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:42:50,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:42:50,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:42:50,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:42:50,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:42:50,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:50,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:50,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:42:50,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:42:50,908 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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2025-01-09 22:42:51,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:42:51,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:42:51,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:42:51,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:42:51,211 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:42:51,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2025-01-09 22:42:52,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8a63a26/d3b674490c3049fea1037c3495ddb0d3/FLAGfd38e2114 [2025-01-09 22:42:52,908 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:42:52,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2025-01-09 22:42:52,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8a63a26/d3b674490c3049fea1037c3495ddb0d3/FLAGfd38e2114 [2025-01-09 22:42:52,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8a63a26/d3b674490c3049fea1037c3495ddb0d3 [2025-01-09 22:42:52,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:42:52,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:42:52,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:42:52,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:42:52,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:42:52,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:42:52" (1/1) ... [2025-01-09 22:42:52,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:52, skipping insertion in model container [2025-01-09 22:42:52,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:42:52" (1/1) ... [2025-01-09 22:42:52,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:42:53,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:42:53,226 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:42:53,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:42:53,310 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:42:53,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53 WrapperNode [2025-01-09 22:42:53,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:42:53,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:42:53,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:42:53,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:42:53,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,359 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2025-01-09 22:42:53,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:42:53,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:42:53,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:42:53,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:42:53,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,401 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2025-01-09 22:42:53,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:42:53,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:42:53,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:42:53,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:42:53,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (1/1) ... [2025-01-09 22:42:53,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:53,477 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-01-09 22:42:53,481 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-01-09 22:42:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 22:42:53,509 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:42:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:42:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:42:53,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:42:53,644 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:42:53,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:42:54,001 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-01-09 22:42:54,001 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:42:54,010 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:42:54,011 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:42:54,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:42:54 BoogieIcfgContainer [2025-01-09 22:42:54,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:42:54,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:42:54,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:42:54,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:42:54,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:42:52" (1/3) ... [2025-01-09 22:42:54,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b60e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:42:54, skipping insertion in model container [2025-01-09 22:42:54,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:53" (2/3) ... [2025-01-09 22:42:54,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b60e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:42:54, skipping insertion in model container [2025-01-09 22:42:54,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:42:54" (3/3) ... [2025-01-09 22:42:54,023 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2025-01-09 22:42:54,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:42:54,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_remove_all_reverse.i that has 2 procedures, 99 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-01-09 22:42:54,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:42:54,083 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;@662823b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:42:54,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-01-09 22:42:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 95 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:42:54,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:54,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:42:54,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 894043989, now seen corresponding path program 1 times [2025-01-09 22:42:54,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:54,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706287711] [2025-01-09 22:42:54,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:54,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:42:54,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:42:54,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:54,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:54,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:54,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706287711] [2025-01-09 22:42:54,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706287711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:54,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:54,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:42:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552668632] [2025-01-09 22:42:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:54,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:54,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:54,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:54,386 INFO L87 Difference]: Start difference. First operand has 99 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 95 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:54,504 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-01-09 22:42:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:42:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:54,514 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:42:54,514 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 22:42:54,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:54,520 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:54,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 22:42:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 22:42:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 50 states have (on average 1.88) internal successors, (94), 89 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2025-01-09 22:42:54,564 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 6 [2025-01-09 22:42:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:54,564 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2025-01-09 22:42:54,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2025-01-09 22:42:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:42:54,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:54,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:42:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:42:54,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash 894043990, now seen corresponding path program 1 times [2025-01-09 22:42:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148396904] [2025-01-09 22:42:54,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:54,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:42:54,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:42:54,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:54,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148396904] [2025-01-09 22:42:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148396904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:42:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511540762] [2025-01-09 22:42:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:54,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:54,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:54,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:54,732 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:54,820 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-01-09 22:42:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:54,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:42:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:54,822 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:42:54,824 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:42:54,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:54,825 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:54,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:42:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 22:42:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.84) internal successors, (92), 87 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2025-01-09 22:42:54,834 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 6 [2025-01-09 22:42:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:54,834 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2025-01-09 22:42:54,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2025-01-09 22:42:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:42:54,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:54,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:54,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:42:54,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:54,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash -900483860, now seen corresponding path program 1 times [2025-01-09 22:42:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695069015] [2025-01-09 22:42:54,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:54,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:42:54,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:42:54,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:54,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695069015] [2025-01-09 22:42:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695069015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:42:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733163330] [2025-01-09 22:42:54,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:54,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:54,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:54,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:54,944 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:42:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:54,959 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2025-01-09 22:42:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:54,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 22:42:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:54,962 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:42:54,962 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:42:54,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:54,963 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:54,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:42:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2025-01-09 22:42:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 88 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-01-09 22:42:54,980 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 13 [2025-01-09 22:42:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:54,980 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-01-09 22:42:54,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:42:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-01-09 22:42:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:42:54,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:54,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:54,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:42:54,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash 915886263, now seen corresponding path program 1 times [2025-01-09 22:42:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769904843] [2025-01-09 22:42:54,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:55,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:42:55,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:42:55,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:55,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:42:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:55,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769904843] [2025-01-09 22:42:55,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769904843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:55,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276932676] [2025-01-09 22:42:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:55,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:55,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:55,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:55,182 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:55,356 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-01-09 22:42:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 22:42:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:55,357 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:42:55,357 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:42:55,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:55,358 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:55,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 276 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:42:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:42:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 22:42:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.803921568627451) internal successors, (92), 87 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2025-01-09 22:42:55,366 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 22 [2025-01-09 22:42:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:55,367 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2025-01-09 22:42:55,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2025-01-09 22:42:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:42:55,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:55,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:55,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:42:55,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:55,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:55,369 INFO L85 PathProgramCache]: Analyzing trace with hash 915886264, now seen corresponding path program 1 times [2025-01-09 22:42:55,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:55,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758364949] [2025-01-09 22:42:55,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:55,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:42:55,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:42:55,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:55,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:55,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:55,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758364949] [2025-01-09 22:42:55,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758364949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:55,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:55,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:55,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684506018] [2025-01-09 22:42:55,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:55,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:55,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:55,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:55,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:55,633 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:55,770 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2025-01-09 22:42:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:55,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 22:42:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:55,771 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:42:55,772 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 22:42:55,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:55,773 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:55,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 300 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 22:42:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 22:42:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 86 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2025-01-09 22:42:55,783 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 22 [2025-01-09 22:42:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:55,784 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2025-01-09 22:42:55,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2025-01-09 22:42:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:42:55,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:55,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:55,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:42:55,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:55,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash -759586278, now seen corresponding path program 1 times [2025-01-09 22:42:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:55,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531105533] [2025-01-09 22:42:55,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:55,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:55,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:55,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:55,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531105533] [2025-01-09 22:42:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531105533] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948104780] [2025-01-09 22:42:56,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:56,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:56,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:56,112 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-01-09 22:42:56,113 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-01-09 22:42:56,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:56,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:56,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:56,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:56,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:42:56,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:56,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:42:56,315 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-01-09 22:42:56,362 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:42:56,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:42:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:42:56,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:56,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948104780] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:42:56,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:42:56,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-01-09 22:42:56,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025031283] [2025-01-09 22:42:56,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:56,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:42:56,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:56,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:42:56,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:42:56,589 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:42:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:56,840 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2025-01-09 22:42:56,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:42:56,840 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-01-09 22:42:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:56,841 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:42:56,841 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:42:56,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:42:56,842 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:56,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 400 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2025-01-09 22:42:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:42:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 22:42:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 85 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2025-01-09 22:42:56,852 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 25 [2025-01-09 22:42:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:56,852 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2025-01-09 22:42:56,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:42:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2025-01-09 22:42:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:42:56,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:56,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:56,867 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-01-09 22:42:57,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:57,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:57,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:57,058 INFO L85 PathProgramCache]: Analyzing trace with hash -759586277, now seen corresponding path program 1 times [2025-01-09 22:42:57,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:57,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-01-09 22:42:57,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:57,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:57,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:57,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:57,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:57,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-01-09 22:42:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190306099] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:57,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025943130] [2025-01-09 22:42:57,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:57,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:57,447 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-01-09 22:42:57,448 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-01-09 22:42:57,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:57,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:57,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:57,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:57,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:42:57,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:57,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:42:57,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:42:57,769 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-01-09 22:42:57,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:57,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:42:57,847 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:42:57,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:42:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-01-09 22:42:57,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:58,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025943130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:58,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:58,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-01-09 22:42:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296084512] [2025-01-09 22:42:58,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:58,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:42:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:58,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:42:58,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2025-01-09 22:42:58,031 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:42:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:58,479 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2025-01-09 22:42:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:42:58,483 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-01-09 22:42:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:58,485 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:42:58,485 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:42:58,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2025-01-09 22:42:58,487 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:58,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 529 Invalid, 0 Unknown, 89 Unchecked, 0.3s Time] [2025-01-09 22:42:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:42:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-01-09 22:42:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2025-01-09 22:42:58,494 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 25 [2025-01-09 22:42:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:58,494 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2025-01-09 22:42:58,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:42:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2025-01-09 22:42:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:42:58,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:58,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:58,504 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-01-09 22:42:58,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:58,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:58,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:58,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1165859427, now seen corresponding path program 1 times [2025-01-09 22:42:58,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:58,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467826043] [2025-01-09 22:42:58,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:58,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:42:58,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:42:58,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:58,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:42:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467826043] [2025-01-09 22:42:58,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467826043] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:58,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238420786] [2025-01-09 22:42:58,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:58,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:58,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:58,837 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-01-09 22:42:58,840 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-01-09 22:42:58,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:42:58,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:42:58,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:58,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:58,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:42:58,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:42:58,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:42:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238420786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:42:58,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-01-09 22:42:58,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060929106] [2025-01-09 22:42:58,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:58,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:42:58,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:58,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:42:58,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:58,981 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:58,999 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2025-01-09 22:42:59,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:42:59,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-01-09 22:42:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:59,002 INFO L225 Difference]: With dead ends: 146 [2025-01-09 22:42:59,002 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 22:42:59,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:59,003 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 122 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:59,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 192 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 22:42:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2025-01-09 22:42:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 85 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:42:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2025-01-09 22:42:59,015 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 29 [2025-01-09 22:42:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:59,015 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2025-01-09 22:42:59,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2025-01-09 22:42:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:42:59,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:59,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:59,025 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-01-09 22:42:59,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:59,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:42:59,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1165862179, now seen corresponding path program 1 times [2025-01-09 22:42:59,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:59,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882556843] [2025-01-09 22:42:59,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:59,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:42:59,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:42:59,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:59,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:42:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:59,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882556843] [2025-01-09 22:42:59,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882556843] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:59,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300552961] [2025-01-09 22:42:59,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:59,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:59,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:59,541 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-01-09 22:42:59,543 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-01-09 22:42:59,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:42:59,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:42:59,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:59,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:59,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:42:59,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:59,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:42:59,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:42:59,696 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-01-09 22:42:59,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:59,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:42:59,761 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-01-09 22:42:59,785 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:42:59,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:42:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2025-01-09 22:42:59,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300552961] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:59,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:59,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2025-01-09 22:42:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335293938] [2025-01-09 22:42:59,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:59,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:42:59,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:59,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:42:59,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2025-01-09 22:42:59,982 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:43:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:00,316 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2025-01-09 22:43:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:43:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-01-09 22:43:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:00,317 INFO L225 Difference]: With dead ends: 126 [2025-01-09 22:43:00,317 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 22:43:00,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=184, Unknown=2, NotChecked=58, Total=306 [2025-01-09 22:43:00,318 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 130 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:00,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 231 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 305 Invalid, 0 Unknown, 254 Unchecked, 0.3s Time] [2025-01-09 22:43:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 22:43:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2025-01-09 22:43:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2025-01-09 22:43:00,331 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 29 [2025-01-09 22:43:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:00,331 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2025-01-09 22:43:00,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:43:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2025-01-09 22:43:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:43:00,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:00,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:00,345 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-01-09 22:43:00,536 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,SelfDestructingSolverStorable8 [2025-01-09 22:43:00,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:00,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1165862178, now seen corresponding path program 1 times [2025-01-09 22:43:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:00,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895359618] [2025-01-09 22:43:00,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:00,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:43:00,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:43:00,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:00,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:00,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:00,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895359618] [2025-01-09 22:43:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895359618] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:00,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352161627] [2025-01-09 22:43:00,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:00,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:00,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:00,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:43:01,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:43:01,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:43:01,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:01,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 22:43:01,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:01,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:43:01,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:43:01,089 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-01-09 22:43:01,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:01,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:43:01,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:43:01,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:01,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:43:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:43:01,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:01,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352161627] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:01,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:01,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2025-01-09 22:43:01,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448570883] [2025-01-09 22:43:01,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:01,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:43:01,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:01,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:43:01,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=246, Unknown=1, NotChecked=32, Total=342 [2025-01-09 22:43:01,471 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:43:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:01,789 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2025-01-09 22:43:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:43:01,790 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-01-09 22:43:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:01,790 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:43:01,791 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:43:01,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=336, Unknown=1, NotChecked=38, Total=462 [2025-01-09 22:43:01,792 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 187 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:01,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 245 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 296 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2025-01-09 22:43:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:43:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 22:43:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.490566037735849) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2025-01-09 22:43:01,795 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 29 [2025-01-09 22:43:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:01,796 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2025-01-09 22:43:01,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:43:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2025-01-09 22:43:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:43:01,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:01,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:01,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:43:02,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 22:43:02,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:02,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash 592910241, now seen corresponding path program 1 times [2025-01-09 22:43:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:02,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363702829] [2025-01-09 22:43:02,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:02,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:43:02,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:43:02,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:02,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363702829] [2025-01-09 22:43:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363702829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:02,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:43:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849792046] [2025-01-09 22:43:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:02,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:43:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:02,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:43:02,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:43:02,219 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:02,594 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2025-01-09 22:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:43:02,595 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-09 22:43:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:02,596 INFO L225 Difference]: With dead ends: 111 [2025-01-09 22:43:02,596 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 22:43:02,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:43:02,597 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 116 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:02,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 314 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:43:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 22:43:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2025-01-09 22:43:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-01-09 22:43:02,601 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 31 [2025-01-09 22:43:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:02,602 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-01-09 22:43:02,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-01-09 22:43:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:43:02,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:02,603 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:02,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:43:02,603 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 592910242, now seen corresponding path program 1 times [2025-01-09 22:43:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790433615] [2025-01-09 22:43:02,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:02,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:43:02,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:43:02,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:02,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:02,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790433615] [2025-01-09 22:43:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790433615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:02,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:43:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125220015] [2025-01-09 22:43:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:02,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:43:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:02,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:43:02,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:43:02,937 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:03,323 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2025-01-09 22:43:03,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:43:03,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-09 22:43:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:03,326 INFO L225 Difference]: With dead ends: 142 [2025-01-09 22:43:03,326 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 22:43:03,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:43:03,327 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 143 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:03,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 430 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:43:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 22:43:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2025-01-09 22:43:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 110 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2025-01-09 22:43:03,334 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 31 [2025-01-09 22:43:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:03,335 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2025-01-09 22:43:03,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2025-01-09 22:43:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:43:03,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:03,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:03,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:43:03,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:03,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1381770149, now seen corresponding path program 1 times [2025-01-09 22:43:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:03,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-01-09 22:43:03,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:03,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:43:03,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:43:03,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:03,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-01-09 22:43:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330616114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112929095] [2025-01-09 22:43:03,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:03,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:03,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:03,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:03,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:43:03,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:43:04,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:43:04,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:04,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-09 22:43:04,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:04,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:43:04,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:43:04,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:43:04,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:04,397 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:43:04,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:43:04,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-01-09 22:43:04,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:43:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:04,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:04,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-01-09 22:43:04,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-01-09 22:43:04,778 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-01-09 22:43:04,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:43:04,783 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_674) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2025-01-09 22:43:04,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:04,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:43:04,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-01-09 22:43:04,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:43:04,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112929095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:04,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:04,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 36 [2025-01-09 22:43:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528502430] [2025-01-09 22:43:04,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:04,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:43:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:04,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:43:04,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1366, Unknown=14, NotChecked=74, Total=1560 [2025-01-09 22:43:04,937 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 32 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:43:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:06,057 INFO L93 Difference]: Finished difference Result 177 states and 217 transitions. [2025-01-09 22:43:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:43:06,058 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 32 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2025-01-09 22:43:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:06,059 INFO L225 Difference]: With dead ends: 177 [2025-01-09 22:43:06,059 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 22:43:06,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=182, Invalid=2064, Unknown=14, NotChecked=92, Total=2352 [2025-01-09 22:43:06,061 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 322 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:06,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 792 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:43:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 22:43:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2025-01-09 22:43:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 107 states have (on average 1.485981308411215) internal successors, (159), 126 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2025-01-09 22:43:06,068 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 36 [2025-01-09 22:43:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:06,069 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2025-01-09 22:43:06,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 32 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:43:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2025-01-09 22:43:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:43:06,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:06,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:06,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:43:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:43:06,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1381770148, now seen corresponding path program 1 times [2025-01-09 22:43:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:06,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155345625] [2025-01-09 22:43:06,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:06,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:43:06,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:43:06,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:06,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:07,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:07,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155345625] [2025-01-09 22:43:07,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155345625] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:07,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22327988] [2025-01-09 22:43:07,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:07,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:07,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:07,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:07,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:43:07,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:43:07,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:43:07,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:07,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:07,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-01-09 22:43:07,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:07,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:43:07,545 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:43:07,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:43:07,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:07,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:07,772 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:43:07,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:43:07,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:43:07,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2025-01-09 22:43:08,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:43:08,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:43:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:08,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:08,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2025-01-09 22:43:08,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2025-01-09 22:43:08,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:08,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2025-01-09 22:43:08,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:08,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-01-09 22:43:08,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-01-09 22:43:08,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:43:08,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:08,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:43:08,835 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:43:08,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 22:43:08,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:08,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:43:08,847 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:43:08,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 22:43:09,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22327988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:09,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:09,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2025-01-09 22:43:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195402599] [2025-01-09 22:43:09,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:09,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 22:43:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:09,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 22:43:09,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=3036, Unknown=1, NotChecked=0, Total=3192 [2025-01-09 22:43:09,110 INFO L87 Difference]: Start difference. First operand 131 states and 165 transitions. Second operand has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 37 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:43:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:10,935 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2025-01-09 22:43:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:43:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 37 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2025-01-09 22:43:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:10,936 INFO L225 Difference]: With dead ends: 200 [2025-01-09 22:43:10,937 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 22:43:10,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=312, Invalid=5089, Unknown=1, NotChecked=0, Total=5402 [2025-01-09 22:43:10,938 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 454 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:10,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1283 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 22:43:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 22:43:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 130. [2025-01-09 22:43:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.4811320754716981) internal successors, (157), 125 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 163 transitions. [2025-01-09 22:43:10,944 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 163 transitions. Word has length 36 [2025-01-09 22:43:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:10,944 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 163 transitions. [2025-01-09 22:43:10,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 37 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:43:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2025-01-09 22:43:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:43:10,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:10,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:10,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:43:11,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:11,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:11,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash 116863375, now seen corresponding path program 1 times [2025-01-09 22:43:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682327284] [2025-01-09 22:43:11,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:11,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:43:11,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:43:11,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:11,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:11,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682327284] [2025-01-09 22:43:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682327284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:11,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:43:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153169656] [2025-01-09 22:43:11,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:43:11,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:11,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:43:11,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:43:11,306 INFO L87 Difference]: Start difference. First operand 130 states and 163 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:11,457 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2025-01-09 22:43:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:43:11,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-01-09 22:43:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:11,460 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:43:11,460 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:43:11,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:43:11,461 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 78 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:11,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 477 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:43:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-01-09 22:43:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.471698113207547) internal successors, (156), 124 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2025-01-09 22:43:11,466 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 37 [2025-01-09 22:43:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:11,466 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2025-01-09 22:43:11,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2025-01-09 22:43:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:43:11,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:11,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:11,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:43:11,467 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:11,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash -671771628, now seen corresponding path program 1 times [2025-01-09 22:43:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-01-09 22:43:11,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:11,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:43:11,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:43:11,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:11,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:11,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:11,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-01-09 22:43:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:11,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:11,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:43:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159524967] [2025-01-09 22:43:11,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:11,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:43:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:11,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:43:11,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:43:11,563 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:11,629 INFO L93 Difference]: Finished difference Result 141 states and 179 transitions. [2025-01-09 22:43:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:43:11,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-01-09 22:43:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:11,631 INFO L225 Difference]: With dead ends: 141 [2025-01-09 22:43:11,631 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 22:43:11,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:43:11,632 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:11,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 22:43:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-01-09 22:43:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 114 states have (on average 1.4736842105263157) internal successors, (168), 132 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 174 transitions. [2025-01-09 22:43:11,639 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 174 transitions. Word has length 38 [2025-01-09 22:43:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:11,639 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 174 transitions. [2025-01-09 22:43:11,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 174 transitions. [2025-01-09 22:43:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:43:11,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:11,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:11,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:43:11,640 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:11,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash -672202576, now seen corresponding path program 1 times [2025-01-09 22:43:11,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:11,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470308682] [2025-01-09 22:43:11,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:11,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:43:11,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:43:11,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:11,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470308682] [2025-01-09 22:43:11,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470308682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:11,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:11,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:43:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790014755] [2025-01-09 22:43:11,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:11,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:43:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:11,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:43:11,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:43:11,831 INFO L87 Difference]: Start difference. First operand 137 states and 174 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:12,068 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2025-01-09 22:43:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:43:12,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-01-09 22:43:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:12,073 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:43:12,073 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:43:12,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:43:12,073 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 77 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:12,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 484 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:43:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:43:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2025-01-09 22:43:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.453781512605042) internal successors, (173), 137 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 179 transitions. [2025-01-09 22:43:12,079 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 179 transitions. Word has length 38 [2025-01-09 22:43:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:12,080 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 179 transitions. [2025-01-09 22:43:12,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2025-01-09 22:43:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:43:12,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:12,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:12,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:43:12,083 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:12,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash 636556721, now seen corresponding path program 1 times [2025-01-09 22:43:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489282644] [2025-01-09 22:43:12,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:12,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:43:12,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:43:12,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:12,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489282644] [2025-01-09 22:43:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489282644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:12,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:43:12,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639635936] [2025-01-09 22:43:12,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:12,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:43:12,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:12,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:43:12,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:43:12,182 INFO L87 Difference]: Start difference. First operand 142 states and 179 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:12,292 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2025-01-09 22:43:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:43:12,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-01-09 22:43:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:12,293 INFO L225 Difference]: With dead ends: 145 [2025-01-09 22:43:12,293 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 22:43:12,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:43:12,294 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:12,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 206 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 22:43:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-01-09 22:43:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 136 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2025-01-09 22:43:12,298 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 39 [2025-01-09 22:43:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:12,299 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2025-01-09 22:43:12,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2025-01-09 22:43:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:43:12,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:12,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:12,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:43:12,300 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:12,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1741578029, now seen corresponding path program 1 times [2025-01-09 22:43:12,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:12,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396227736] [2025-01-09 22:43:12,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:12,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:12,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:43:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:43:12,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:12,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396227736] [2025-01-09 22:43:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396227736] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139590682] [2025-01-09 22:43:12,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:12,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:12,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:12,540 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:12,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:43:12,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:43:12,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:43:12,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:12,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:12,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:43:12,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:12,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:12,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:43:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:12,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:43:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139590682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:12,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:43:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2025-01-09 22:43:12,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153767409] [2025-01-09 22:43:12,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:12,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:43:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:12,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:43:12,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:43:12,801 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:12,891 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2025-01-09 22:43:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:43:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-01-09 22:43:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:12,892 INFO L225 Difference]: With dead ends: 140 [2025-01-09 22:43:12,892 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 22:43:12,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:43:12,893 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 124 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:12,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 114 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 22:43:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-01-09 22:43:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 135 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2025-01-09 22:43:12,897 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 40 [2025-01-09 22:43:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:12,897 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2025-01-09 22:43:12,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2025-01-09 22:43:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:43:12,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:12,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:12,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:43:13,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:13,100 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:13,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1712782305, now seen corresponding path program 2 times [2025-01-09 22:43:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:13,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277669633] [2025-01-09 22:43:13,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:43:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:13,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-09 22:43:13,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:43:13,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:43:13,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:13,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:13,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277669633] [2025-01-09 22:43:13,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277669633] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:13,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40841023] [2025-01-09 22:43:13,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:43:13,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:13,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:13,719 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:13,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:43:13,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-09 22:43:13,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:43:13,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:43:13,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:13,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-01-09 22:43:13,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:13,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:43:14,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:43:14,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:43:14,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:14,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:14,242 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 22:43:14,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2025-01-09 22:43:14,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-01-09 22:43:14,770 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-01-09 22:43:14,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 40 [2025-01-09 22:43:14,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-01-09 22:43:14,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:43:14,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:43:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:14,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:15,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2025-01-09 22:43:15,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2025-01-09 22:43:15,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:15,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 840 treesize of output 720 [2025-01-09 22:43:15,396 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:43:15,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 840 treesize of output 1 [2025-01-09 22:43:15,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40841023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:15,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:15,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 42 [2025-01-09 22:43:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196710263] [2025-01-09 22:43:15,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:15,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 22:43:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:15,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 22:43:15,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2788, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 22:43:15,510 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 42 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 37 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:43:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:16,719 INFO L93 Difference]: Finished difference Result 160 states and 193 transitions. [2025-01-09 22:43:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:43:16,719 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 37 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2025-01-09 22:43:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:16,720 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:43:16,720 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:43:16,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=349, Invalid=4207, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 22:43:16,722 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 200 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:16,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 923 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:43:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:43:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2025-01-09 22:43:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 135 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 176 transitions. [2025-01-09 22:43:16,726 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 176 transitions. Word has length 41 [2025-01-09 22:43:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 176 transitions. [2025-01-09 22:43:16,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 37 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:43:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 176 transitions. [2025-01-09 22:43:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:43:16,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:16,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:16,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:43:16,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:16,928 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:16,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1075767834, now seen corresponding path program 1 times [2025-01-09 22:43:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369552656] [2025-01-09 22:43:16,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:16,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:43:16,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:43:16,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:16,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:17,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:17,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369552656] [2025-01-09 22:43:17,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369552656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:17,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633400103] [2025-01-09 22:43:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:17,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:17,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:17,028 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:17,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:43:17,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:43:17,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:43:17,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:17,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:17,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:43:17,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:17,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:43:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:43:17,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:43:17,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633400103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:17,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:43:17,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2025-01-09 22:43:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810713606] [2025-01-09 22:43:17,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:17,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:43:17,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:17,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:43:17,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:43:17,412 INFO L87 Difference]: Start difference. First operand 140 states and 176 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:17,615 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2025-01-09 22:43:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:43:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-01-09 22:43:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:17,616 INFO L225 Difference]: With dead ends: 174 [2025-01-09 22:43:17,616 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 22:43:17,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:43:17,617 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 148 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:17,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 301 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:43:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 22:43:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2025-01-09 22:43:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.4210526315789473) internal successors, (189), 148 states have internal predecessors, (189), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 195 transitions. [2025-01-09 22:43:17,624 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 195 transitions. Word has length 43 [2025-01-09 22:43:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:17,625 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 195 transitions. [2025-01-09 22:43:17,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 195 transitions. [2025-01-09 22:43:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:43:17,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:17,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:17,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:43:17,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:17,830 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:17,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1075767835, now seen corresponding path program 1 times [2025-01-09 22:43:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:17,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286485428] [2025-01-09 22:43:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:17,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:43:17,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:43:17,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:17,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:18,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286485428] [2025-01-09 22:43:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286485428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247744376] [2025-01-09 22:43:18,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:18,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:18,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:18,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:18,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:43:18,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:43:18,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:43:18,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:18,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:18,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 22:43:18,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:18,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:43:18,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:43:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:18,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:19,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-01-09 22:43:19,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:43:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247744376] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:19,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:19,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14, 15] total 41 [2025-01-09 22:43:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374942278] [2025-01-09 22:43:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:19,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:43:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:19,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:43:19,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1576, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 22:43:19,306 INFO L87 Difference]: Start difference. First operand 153 states and 195 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:19,749 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2025-01-09 22:43:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:43:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-01-09 22:43:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:19,754 INFO L225 Difference]: With dead ends: 166 [2025-01-09 22:43:19,754 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 22:43:19,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=2151, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 22:43:19,756 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 155 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:19,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 513 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:43:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 22:43:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2025-01-09 22:43:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.373134328358209) internal successors, (184), 147 states have internal predecessors, (184), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 190 transitions. [2025-01-09 22:43:19,760 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 190 transitions. Word has length 43 [2025-01-09 22:43:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:19,760 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 190 transitions. [2025-01-09 22:43:19,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 190 transitions. [2025-01-09 22:43:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:43:19,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:19,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:19,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:43:19,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 22:43:19,962 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:19,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash -146046754, now seen corresponding path program 1 times [2025-01-09 22:43:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:19,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-01-09 22:43:19,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:19,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:43:19,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:43:19,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:19,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-01-09 22:43:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235247854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:43:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402319559] [2025-01-09 22:43:20,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:20,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:43:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:20,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:43:20,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:43:20,021 INFO L87 Difference]: Start difference. First operand 152 states and 190 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:20,075 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2025-01-09 22:43:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:43:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-01-09 22:43:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:20,077 INFO L225 Difference]: With dead ends: 150 [2025-01-09 22:43:20,077 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 22:43:20,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:43:20,077 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 61 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:20,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:43:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 22:43:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-09 22:43:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 134 states have (on average 1.3507462686567164) internal successors, (181), 145 states have internal predecessors, (181), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 187 transitions. [2025-01-09 22:43:20,086 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 187 transitions. Word has length 43 [2025-01-09 22:43:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:20,086 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 187 transitions. [2025-01-09 22:43:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 187 transitions. [2025-01-09 22:43:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:43:20,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:20,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:43:20,087 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:20,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1382993066, now seen corresponding path program 1 times [2025-01-09 22:43:20,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:20,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339589195] [2025-01-09 22:43:20,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:20,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:20,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:43:20,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:43:20,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:43:20,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:20,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339589195] [2025-01-09 22:43:20,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339589195] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:20,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278004253] [2025-01-09 22:43:20,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:20,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:20,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:20,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:43:20,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:43:20,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:43:20,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:20,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:20,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:43:20,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:20,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278004253] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:43:20,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:43:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 22:43:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244908536] [2025-01-09 22:43:20,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:20,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:43:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:20,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:43:20,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:43:20,487 INFO L87 Difference]: Start difference. First operand 150 states and 187 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:43:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:20,530 INFO L93 Difference]: Finished difference Result 254 states and 310 transitions. [2025-01-09 22:43:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:43:20,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-01-09 22:43:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:20,532 INFO L225 Difference]: With dead ends: 254 [2025-01-09 22:43:20,532 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 22:43:20,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:43:20,532 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 169 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:20,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 331 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:43:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 22:43:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 171. [2025-01-09 22:43:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 166 states have internal predecessors, (209), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 215 transitions. [2025-01-09 22:43:20,538 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 215 transitions. Word has length 45 [2025-01-09 22:43:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:20,538 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 215 transitions. [2025-01-09 22:43:20,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:43:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 215 transitions. [2025-01-09 22:43:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:43:20,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:20,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:20,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:43:20,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:20,739 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:20,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1380345506, now seen corresponding path program 1 times [2025-01-09 22:43:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:20,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603385717] [2025-01-09 22:43:20,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:20,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:20,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:43:20,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:43:20,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:20,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603385717] [2025-01-09 22:43:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603385717] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557849723] [2025-01-09 22:43:21,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:21,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:21,402 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:21,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:43:21,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:43:21,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:43:21,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:21,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:21,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-01-09 22:43:21,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:21,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:43:21,615 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:43:21,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:43:21,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:21,709 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:43:21,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-01-09 22:43:21,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:21,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-01-09 22:43:21,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 22:43:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:21,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:22,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:43:22,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:43:22,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:22,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-01-09 22:43:22,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:22,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2025-01-09 22:43:22,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 22:43:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557849723] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:43:22,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:43:22,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-01-09 22:43:22,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585159897] [2025-01-09 22:43:22,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:22,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 22:43:22,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:22,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 22:43:22,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1994, Unknown=26, NotChecked=0, Total=2162 [2025-01-09 22:43:22,554 INFO L87 Difference]: Start difference. First operand 171 states and 215 transitions. Second operand has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 41 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:43:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:23,291 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions. [2025-01-09 22:43:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:43:23,292 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 41 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 45 [2025-01-09 22:43:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:23,292 INFO L225 Difference]: With dead ends: 190 [2025-01-09 22:43:23,292 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 22:43:23,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=2923, Unknown=26, NotChecked=0, Total=3192 [2025-01-09 22:43:23,293 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 79 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:23,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1039 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:43:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 22:43:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 171. [2025-01-09 22:43:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 155 states have (on average 1.3419354838709678) internal successors, (208), 166 states have internal predecessors, (208), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 214 transitions. [2025-01-09 22:43:23,298 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 214 transitions. Word has length 45 [2025-01-09 22:43:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:23,298 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 214 transitions. [2025-01-09 22:43:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 41 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:43:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 214 transitions. [2025-01-09 22:43:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:43:23,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:23,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:23,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:43:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:23,500 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:23,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:23,501 INFO L85 PathProgramCache]: Analyzing trace with hash -846363137, now seen corresponding path program 1 times [2025-01-09 22:43:23,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337372560] [2025-01-09 22:43:23,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:23,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:43:23,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:43:23,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:23,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:24,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337372560] [2025-01-09 22:43:24,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337372560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:24,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335715328] [2025-01-09 22:43:24,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:24,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:24,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:24,057 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:24,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:43:24,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:43:24,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:43:24,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:24,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:24,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-09 22:43:24,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:24,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:43:24,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:43:24,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:43:24,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:43:24,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:24,641 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:43:24,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:43:24,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-01-09 22:43:24,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:43:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:25,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:25,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-01-09 22:43:25,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-01-09 22:43:25,313 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2025-01-09 22:43:25,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2025-01-09 22:43:25,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:25,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:43:25,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-01-09 22:43:25,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-09 22:43:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335715328] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:25,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:25,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 40 [2025-01-09 22:43:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192326793] [2025-01-09 22:43:25,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:25,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 22:43:25,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:25,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 22:43:25,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1686, Unknown=2, NotChecked=166, Total=1980 [2025-01-09 22:43:25,388 INFO L87 Difference]: Start difference. First operand 171 states and 214 transitions. Second operand has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 36 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:43:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:26,105 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2025-01-09 22:43:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:43:26,105 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 36 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2025-01-09 22:43:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:26,106 INFO L225 Difference]: With dead ends: 185 [2025-01-09 22:43:26,106 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 22:43:26,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=2452, Unknown=2, NotChecked=202, Total=2862 [2025-01-09 22:43:26,107 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 199 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:26,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 663 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:43:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 22:43:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2025-01-09 22:43:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 156 states have (on average 1.3397435897435896) internal successors, (209), 167 states have internal predecessors, (209), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 215 transitions. [2025-01-09 22:43:26,112 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 215 transitions. Word has length 46 [2025-01-09 22:43:26,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:26,112 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 215 transitions. [2025-01-09 22:43:26,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 36 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:43:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 215 transitions. [2025-01-09 22:43:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:43:26,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:26,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:26,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 22:43:26,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:43:26,314 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:26,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -467520846, now seen corresponding path program 1 times [2025-01-09 22:43:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210895722] [2025-01-09 22:43:26,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:26,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:43:26,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:43:26,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:26,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:26,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210895722] [2025-01-09 22:43:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210895722] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190529954] [2025-01-09 22:43:26,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:26,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:26,555 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:26,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:43:26,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:43:26,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:43:26,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:26,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:26,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-01-09 22:43:26,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:27,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-01-09 22:43:27,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:43:27,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:43:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:27,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:27,236 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2025-01-09 22:43:27,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-01-09 22:43:27,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:43:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:27,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190529954] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:43:27,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:43:27,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 9] total 32 [2025-01-09 22:43:27,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064519575] [2025-01-09 22:43:27,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:27,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:43:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:27,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:43:27,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:43:27,271 INFO L87 Difference]: Start difference. First operand 172 states and 215 transitions. Second operand has 32 states, 32 states have (on average 2.59375) internal successors, (83), 31 states have internal predecessors, (83), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:43:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:28,049 INFO L93 Difference]: Finished difference Result 216 states and 277 transitions. [2025-01-09 22:43:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:43:28,050 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.59375) internal successors, (83), 31 states have internal predecessors, (83), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-01-09 22:43:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:28,051 INFO L225 Difference]: With dead ends: 216 [2025-01-09 22:43:28,051 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 22:43:28,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=1916, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 22:43:28,052 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 179 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:28,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 751 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:43:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 22:43:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2025-01-09 22:43:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 184 states have (on average 1.358695652173913) internal successors, (250), 195 states have internal predecessors, (250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 256 transitions. [2025-01-09 22:43:28,057 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 256 transitions. Word has length 47 [2025-01-09 22:43:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:28,057 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 256 transitions. [2025-01-09 22:43:28,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.59375) internal successors, (83), 31 states have internal predecessors, (83), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:43:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 256 transitions. [2025-01-09 22:43:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:43:28,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:28,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:28,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-09 22:43:28,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 22:43:28,259 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:28,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1121256595, now seen corresponding path program 3 times [2025-01-09 22:43:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:28,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796618604] [2025-01-09 22:43:28,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:43:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:28,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 3 equivalence classes. [2025-01-09 22:43:28,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 48 statements. [2025-01-09 22:43:28,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:43:28,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:43:28,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:28,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796618604] [2025-01-09 22:43:28,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796618604] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473680234] [2025-01-09 22:43:28,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:43:28,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:28,330 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:28,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:43:28,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 3 equivalence classes. [2025-01-09 22:43:28,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 48 statements. [2025-01-09 22:43:28,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:43:28,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:28,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:43:28,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:28,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:43:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473680234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:28,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:43:28,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 22:43:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708148155] [2025-01-09 22:43:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:28,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:43:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:28,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:43:28,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:43:28,547 INFO L87 Difference]: Start difference. First operand 200 states and 256 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:43:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:28,559 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2025-01-09 22:43:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:43:28,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-01-09 22:43:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:28,560 INFO L225 Difference]: With dead ends: 157 [2025-01-09 22:43:28,560 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 22:43:28,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:43:28,561 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:28,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:43:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 22:43:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-01-09 22:43:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 153 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2025-01-09 22:43:28,565 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 48 [2025-01-09 22:43:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:28,565 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2025-01-09 22:43:28,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:43:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2025-01-09 22:43:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:43:28,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:28,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:28,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-09 22:43:28,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:43:28,770 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1606151518, now seen corresponding path program 1 times [2025-01-09 22:43:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793859987] [2025-01-09 22:43:28,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:28,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:43:28,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:43:28,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:28,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793859987] [2025-01-09 22:43:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793859987] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613883405] [2025-01-09 22:43:28,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:28,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:28,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:28,906 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:28,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:43:29,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:43:29,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:43:29,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:29,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:29,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:43:29,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:29,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:29,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:43:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:43:29,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:43:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613883405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:29,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:43:29,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2025-01-09 22:43:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638402444] [2025-01-09 22:43:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:29,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:43:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:29,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:43:29,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:43:29,178 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:29,249 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2025-01-09 22:43:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:43:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2025-01-09 22:43:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:29,250 INFO L225 Difference]: With dead ends: 156 [2025-01-09 22:43:29,250 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 22:43:29,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:43:29,251 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 95 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:29,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 101 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 22:43:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-01-09 22:43:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.323943661971831) internal successors, (188), 152 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2025-01-09 22:43:29,254 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 48 [2025-01-09 22:43:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:29,255 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2025-01-09 22:43:29,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2025-01-09 22:43:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:43:29,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:29,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:29,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-09 22:43:29,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 22:43:29,456 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:29,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1748910569, now seen corresponding path program 1 times [2025-01-09 22:43:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:29,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276811240] [2025-01-09 22:43:29,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:29,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:43:29,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:43:29,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:29,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276811240] [2025-01-09 22:43:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276811240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153022123] [2025-01-09 22:43:30,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:30,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:30,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:30,234 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:30,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 22:43:30,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:43:30,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:43:30,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:30,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:30,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:43:30,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:30,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:43:30,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-01-09 22:43:30,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:43:30,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 22:43:31,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:43:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:31,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:31,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 22:43:31,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 22:43:31,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 22:43:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:31,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153022123] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:43:31,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:43:31,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 20] total 60 [2025-01-09 22:43:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065579030] [2025-01-09 22:43:31,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:31,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-01-09 22:43:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:31,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-01-09 22:43:31,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3489, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 22:43:31,655 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 56 states have internal predecessors, (110), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:43:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:34,075 INFO L93 Difference]: Finished difference Result 171 states and 214 transitions. [2025-01-09 22:43:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-09 22:43:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 56 states have internal predecessors, (110), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2025-01-09 22:43:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:34,076 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:43:34,076 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:43:34,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=792, Invalid=9714, Unknown=0, NotChecked=0, Total=10506 [2025-01-09 22:43:34,079 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 446 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:34,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 799 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:43:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:43:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-01-09 22:43:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 155 states have (on average 1.3419354838709678) internal successors, (208), 165 states have internal predecessors, (208), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 212 transitions. [2025-01-09 22:43:34,082 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 212 transitions. Word has length 49 [2025-01-09 22:43:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:34,083 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 212 transitions. [2025-01-09 22:43:34,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 56 states have internal predecessors, (110), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:43:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 212 transitions. [2025-01-09 22:43:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:43:34,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:34,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:34,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-09 22:43:34,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:34,284 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:34,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash 777477596, now seen corresponding path program 1 times [2025-01-09 22:43:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293031437] [2025-01-09 22:43:34,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:34,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:43:34,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:43:34,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:34,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:34,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293031437] [2025-01-09 22:43:34,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293031437] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214441967] [2025-01-09 22:43:34,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:34,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:34,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:34,416 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:34,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-09 22:43:34,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:43:34,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:43:34,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:34,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:34,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:43:34,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:34,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2025-01-09 22:43:34,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-01-09 22:43:34,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:43:34,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 22:43:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:34,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:34,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 22:43:34,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 22:43:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:43:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214441967] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:43:34,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:43:34,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2025-01-09 22:43:34,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595382007] [2025-01-09 22:43:34,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:34,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:43:34,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:34,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:43:34,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:43:34,700 INFO L87 Difference]: Start difference. First operand 169 states and 212 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:34,836 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2025-01-09 22:43:34,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:43:34,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-01-09 22:43:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:34,837 INFO L225 Difference]: With dead ends: 162 [2025-01-09 22:43:34,837 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 22:43:34,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:43:34,837 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:34,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 289 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 22:43:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-01-09 22:43:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 148 states have (on average 1.3243243243243243) internal successors, (196), 158 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2025-01-09 22:43:34,841 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 50 [2025-01-09 22:43:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:34,841 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2025-01-09 22:43:34,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:43:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2025-01-09 22:43:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:43:34,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:34,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:34,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-09 22:43:35,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:35,042 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:35,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash -439030992, now seen corresponding path program 1 times [2025-01-09 22:43:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:35,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115862752] [2025-01-09 22:43:35,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:35,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:43:35,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:43:35,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:35,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:43:35,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:35,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115862752] [2025-01-09 22:43:35,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115862752] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:35,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609616978] [2025-01-09 22:43:35,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:35,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:35,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:35,176 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:35,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-09 22:43:35,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:43:35,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:43:35,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:35,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:35,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 22:43:35,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:35,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:43:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:43:35,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:35,540 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-01-09 22:43:35,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 22:43:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:43:35,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609616978] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:43:35,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:43:35,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2025-01-09 22:43:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694776579] [2025-01-09 22:43:35,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:35,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:43:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:35,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:43:35,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:43:35,619 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:43:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:35,892 INFO L93 Difference]: Finished difference Result 240 states and 293 transitions. [2025-01-09 22:43:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:43:35,893 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-01-09 22:43:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:35,894 INFO L225 Difference]: With dead ends: 240 [2025-01-09 22:43:35,894 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 22:43:35,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:43:35,895 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 240 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:35,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 323 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:43:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 22:43:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 218. [2025-01-09 22:43:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 204 states have (on average 1.3431372549019607) internal successors, (274), 214 states have internal predecessors, (274), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2025-01-09 22:43:35,904 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 55 [2025-01-09 22:43:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:35,905 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2025-01-09 22:43:35,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:43:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2025-01-09 22:43:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 22:43:35,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:35,906 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:35,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-09 22:43:36,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:36,107 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2025-01-09 22:43:36,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash -204019156, now seen corresponding path program 2 times [2025-01-09 22:43:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600696005] [2025-01-09 22:43:36,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:43:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:36,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-01-09 22:43:36,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:43:36,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:43:36,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:43:36,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:36,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600696005] [2025-01-09 22:43:36,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600696005] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:36,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524517458] [2025-01-09 22:43:36,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:43:36,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:36,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:36,454 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:36,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-09 22:43:36,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-01-09 22:43:36,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:43:36,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:43:36,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:36,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 156 conjuncts are in the unsatisfiable core [2025-01-09 22:43:36,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:36,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:43:36,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:43:36,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:43:36,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:36,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:36,974 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 22:43:36,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2025-01-09 22:43:36,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-01-09 22:43:39,628 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2025-01-09 22:43:39,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2025-01-09 22:43:40,221 INFO L349 Elim1Store]: treesize reduction 252, result has 33.7 percent of original size [2025-01-09 22:43:40,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 306 treesize of output 332 [2025-01-09 22:43:40,359 INFO L349 Elim1Store]: treesize reduction 208, result has 31.6 percent of original size [2025-01-09 22:43:40,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 209 treesize of output 261