./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.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/heap-manipulation/sll_to_dll_rev-2.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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:34:26,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:34:26,450 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:34:26,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:34:26,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:34:26,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:34:26,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:34:26,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:34:26,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:34:26,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:34:26,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:34:26,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:34:26,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:34:26,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:34:26,469 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:34:26,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:34:26,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:34:26,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:34:26,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:34:26,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:26,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:26,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:26,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:26,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:34:26,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:26,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:26,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:26,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:26,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:34:26,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:34:26,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:34:26,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:34:26,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:34:26,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:34:26,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:34:26,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:34:26,472 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2025-01-09 22:34:26,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:34:26,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:34:26,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:34:26,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:34:26,659 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:34:26,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2025-01-09 22:34:27,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96bd7225c/626e8e10d089410d9a7f97c8a65bfe71/FLAG8a278ad85 [2025-01-09 22:34:28,142 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:34:28,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2025-01-09 22:34:28,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96bd7225c/626e8e10d089410d9a7f97c8a65bfe71/FLAG8a278ad85 [2025-01-09 22:34:28,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96bd7225c/626e8e10d089410d9a7f97c8a65bfe71 [2025-01-09 22:34:28,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:34:28,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:34:28,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:28,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:34:28,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:34:28,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bc534f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28, skipping insertion in model container [2025-01-09 22:34:28,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:34:28,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:28,759 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:34:28,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:28,833 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:34:28,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28 WrapperNode [2025-01-09 22:34:28,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:28,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:28,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:34:28,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:34:28,841 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:34:28" (1/1) ... [2025-01-09 22:34:28,853 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:34:28" (1/1) ... [2025-01-09 22:34:28,869 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-01-09 22:34:28,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:28,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:34:28,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:34:28,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:34:28,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,897 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 6, 8, 18, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 7, 1]. [2025-01-09 22:34:28,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:34:28,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:34:28,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:34:28,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:34:28,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (1/1) ... [2025-01-09 22:34:28,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:28,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:28,941 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:34:28,944 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:34:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-01-09 22:34:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-01-09 22:34:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:34:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:34:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:34:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:34:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:34:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:34:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 22:34:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 22:34:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:34:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:34:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:34:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 22:34:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 22:34:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2025-01-09 22:34:28,964 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2025-01-09 22:34:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:34:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:34:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:34:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:34:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 22:34:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 22:34:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2025-01-09 22:34:28,966 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2025-01-09 22:34:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:34:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:34:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:34:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:34:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 22:34:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2025-01-09 22:34:28,966 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2025-01-09 22:34:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:34:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:34:29,100 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:34:29,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:34:29,478 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-01-09 22:34:29,478 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:34:29,487 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:34:29,487 INFO L312 CfgBuilder]: Removed 16 assume(true) statements. [2025-01-09 22:34:29,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:29 BoogieIcfgContainer [2025-01-09 22:34:29,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:34:29,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:34:29,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:34:29,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:34:29,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:34:28" (1/3) ... [2025-01-09 22:34:29,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501dc53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:29, skipping insertion in model container [2025-01-09 22:34:29,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:28" (2/3) ... [2025-01-09 22:34:29,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501dc53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:29, skipping insertion in model container [2025-01-09 22:34:29,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:29" (3/3) ... [2025-01-09 22:34:29,496 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2025-01-09 22:34:29,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:34:29,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_to_dll_rev-2.i that has 5 procedures, 224 locations, 1 initial locations, 21 loop locations, and 83 error locations. [2025-01-09 22:34:29,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:34:29,553 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;@7fdd9ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:34:29,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-01-09 22:34:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 122 states have (on average 2.040983606557377) internal successors, (249), 210 states have internal predecessors, (249), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 22:34:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:34:29,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:29,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:34:29,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:29,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 6528614, now seen corresponding path program 1 times [2025-01-09 22:34:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:29,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747841779] [2025-01-09 22:34:29,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:29,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:34:29,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:34:29,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,684 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:34:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747841779] [2025-01-09 22:34:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747841779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:29,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223337847] [2025-01-09 22:34:29,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:29,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:34:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:29,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:34:29,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:34:29,706 INFO L87 Difference]: Start difference. First operand has 224 states, 122 states have (on average 2.040983606557377) internal successors, (249), 210 states have internal predecessors, (249), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:29,729 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2025-01-09 22:34:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:34:29,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:34:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:29,735 INFO L225 Difference]: With dead ends: 221 [2025-01-09 22:34:29,735 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 22:34:29,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:34:29,738 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:29,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 22:34:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-01-09 22:34:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 116 states have (on average 1.8448275862068966) internal successors, (214), 205 states have internal predecessors, (214), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2025-01-09 22:34:29,778 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 4 [2025-01-09 22:34:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2025-01-09 22:34:29,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2025-01-09 22:34:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:34:29,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:29,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:34:29,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:34:29,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:29,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1987388738, now seen corresponding path program 1 times [2025-01-09 22:34:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4053999] [2025-01-09 22:34:29,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:29,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:34:29,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:34:29,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,904 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:34:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4053999] [2025-01-09 22:34:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4053999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295832291] [2025-01-09 22:34:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:29,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:29,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:29,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:29,907 INFO L87 Difference]: Start difference. First operand 219 states and 240 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:34:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:30,056 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2025-01-09 22:34:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:30,057 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:34:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:30,058 INFO L225 Difference]: With dead ends: 217 [2025-01-09 22:34:30,058 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 22:34:30,058 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:34:30,059 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 2 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:30,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 381 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 22:34:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-01-09 22:34:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 116 states have (on average 1.8275862068965518) internal successors, (212), 203 states have internal predecessors, (212), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2025-01-09 22:34:30,072 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 6 [2025-01-09 22:34:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:30,072 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2025-01-09 22:34:30,073 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:34:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2025-01-09 22:34:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:34:30,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:30,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:34:30,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:34:30,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:30,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1987388739, now seen corresponding path program 1 times [2025-01-09 22:34:30,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:30,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226807760] [2025-01-09 22:34:30,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:30,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:34:30,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:34:30,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,179 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:34:30,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:30,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226807760] [2025-01-09 22:34:30,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226807760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:30,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:30,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:30,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816841270] [2025-01-09 22:34:30,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:30,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:30,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:30,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:30,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:30,182 INFO L87 Difference]: Start difference. First operand 217 states and 238 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:34:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:30,278 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2025-01-09 22:34:30,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:30,278 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:34:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:30,279 INFO L225 Difference]: With dead ends: 215 [2025-01-09 22:34:30,279 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 22:34:30,279 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:34:30,280 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 386 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:34:30,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 386 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 22:34:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-01-09 22:34:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 116 states have (on average 1.8103448275862069) internal successors, (210), 201 states have internal predecessors, (210), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2025-01-09 22:34:30,295 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 6 [2025-01-09 22:34:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:30,295 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2025-01-09 22:34:30,295 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:34:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2025-01-09 22:34:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:34:30,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:30,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:30,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:34:30,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:30,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1089690406, now seen corresponding path program 1 times [2025-01-09 22:34:30,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:30,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707121755] [2025-01-09 22:34:30,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:30,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:34:30,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:34:30,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,479 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:34:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707121755] [2025-01-09 22:34:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707121755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:30,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252452390] [2025-01-09 22:34:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:30,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:30,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:30,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:30,480 INFO L87 Difference]: Start difference. First operand 215 states and 236 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:34:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:30,668 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2025-01-09 22:34:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:30,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2025-01-09 22:34:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:30,669 INFO L225 Difference]: With dead ends: 210 [2025-01-09 22:34:30,669 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 22:34:30,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:30,670 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 45 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:30,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 606 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 22:34:30,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-01-09 22:34:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 196 states have internal predecessors, (205), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2025-01-09 22:34:30,678 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 10 [2025-01-09 22:34:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:30,678 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2025-01-09 22:34:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:34:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2025-01-09 22:34:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:34:30,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:30,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:30,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:34:30,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:30,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1089690407, now seen corresponding path program 1 times [2025-01-09 22:34:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604354491] [2025-01-09 22:34:30,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:30,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:34:30,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:34:30,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,855 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:34:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:30,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604354491] [2025-01-09 22:34:30,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604354491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:30,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:34:30,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040001868] [2025-01-09 22:34:30,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:30,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:30,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:30,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:30,856 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:34:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:31,194 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2025-01-09 22:34:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2025-01-09 22:34:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:31,196 INFO L225 Difference]: With dead ends: 205 [2025-01-09 22:34:31,199 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 22:34:31,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:34:31,200 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 36 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:31,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 546 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 22:34:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-01-09 22:34:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.7241379310344827) internal successors, (200), 191 states have internal predecessors, (200), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2025-01-09 22:34:31,209 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 10 [2025-01-09 22:34:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:31,209 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2025-01-09 22:34:31,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:34:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2025-01-09 22:34:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:34:31,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:31,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:31,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:34:31,209 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:31,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:31,210 INFO L85 PathProgramCache]: Analyzing trace with hash -579335793, now seen corresponding path program 1 times [2025-01-09 22:34:31,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:31,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350775657] [2025-01-09 22:34:31,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:31,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:34:31,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:34:31,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:31,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:31,269 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:34:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350775657] [2025-01-09 22:34:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350775657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:31,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:34:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648226623] [2025-01-09 22:34:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:31,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:31,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:31,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:31,271 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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:34:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:31,401 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2025-01-09 22:34:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:31,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2025-01-09 22:34:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:31,403 INFO L225 Difference]: With dead ends: 204 [2025-01-09 22:34:31,403 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 22:34:31,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:31,403 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 3 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:31,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 644 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 22:34:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-09 22:34:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 116 states have (on average 1.7155172413793103) internal successors, (199), 190 states have internal predecessors, (199), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2025-01-09 22:34:31,408 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2025-01-09 22:34:31,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:31,408 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2025-01-09 22:34:31,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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:34:31,408 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2025-01-09 22:34:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:34:31,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:31,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:34:31,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -579335792, now seen corresponding path program 1 times [2025-01-09 22:34:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670470973] [2025-01-09 22:34:31,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:31,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:34:31,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:34:31,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:31,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:31,522 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:34:31,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:31,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670470973] [2025-01-09 22:34:31,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670470973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:31,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:31,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:31,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430138682] [2025-01-09 22:34:31,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:31,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:31,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:31,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:31,527 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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:34:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:31,705 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2025-01-09 22:34:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2025-01-09 22:34:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:31,707 INFO L225 Difference]: With dead ends: 203 [2025-01-09 22:34:31,708 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 22:34:31,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:31,709 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 4 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:31,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 726 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 22:34:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-01-09 22:34:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 116 states have (on average 1.706896551724138) internal successors, (198), 189 states have internal predecessors, (198), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2025-01-09 22:34:31,716 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 11 [2025-01-09 22:34:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:31,717 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2025-01-09 22:34:31,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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:34:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2025-01-09 22:34:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:34:31,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:31,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:31,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:34:31,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:31,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2134430621, now seen corresponding path program 1 times [2025-01-09 22:34:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784662023] [2025-01-09 22:34:31,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:31,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:34:31,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:34:31,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:31,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:31,934 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:34:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784662023] [2025-01-09 22:34:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784662023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:31,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:31,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:34:31,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166741528] [2025-01-09 22:34:31,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:31,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:31,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:31,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:31,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:31,936 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:34:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:32,274 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2025-01-09 22:34:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:32,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2025-01-09 22:34:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:32,276 INFO L225 Difference]: With dead ends: 202 [2025-01-09 22:34:32,276 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 22:34:32,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:32,276 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 101 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:32,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 491 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 22:34:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-01-09 22:34:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 116 states have (on average 1.6982758620689655) internal successors, (197), 188 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2025-01-09 22:34:32,282 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2025-01-09 22:34:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:32,283 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2025-01-09 22:34:32,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:34:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2025-01-09 22:34:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:34:32,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:32,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:32,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:34:32,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:32,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2134430620, now seen corresponding path program 1 times [2025-01-09 22:34:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137195222] [2025-01-09 22:34:32,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:32,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:34:32,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:34:32,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:32,586 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:34:32,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:32,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137195222] [2025-01-09 22:34:32,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137195222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:32,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:32,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:34:32,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875764979] [2025-01-09 22:34:32,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:32,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:32,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:32,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:32,592 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:34:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:33,071 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2025-01-09 22:34:33,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:33,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 19 [2025-01-09 22:34:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:33,073 INFO L225 Difference]: With dead ends: 201 [2025-01-09 22:34:33,073 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 22:34:33,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:33,078 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 56 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:33,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 498 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:34:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 22:34:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-01-09 22:34:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 187 states have internal predecessors, (196), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:34:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2025-01-09 22:34:33,087 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 19 [2025-01-09 22:34:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:33,087 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2025-01-09 22:34:33,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:34:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2025-01-09 22:34:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:34:33,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:33,087 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] [2025-01-09 22:34:33,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:34:33,088 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:34:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1534934145, now seen corresponding path program 1 times [2025-01-09 22:34:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51197026] [2025-01-09 22:34:33,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:33,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:34:33,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:34:33,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:33,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:33,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:33,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51197026] [2025-01-09 22:34:33,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51197026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:33,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315436462] [2025-01-09 22:34:33,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:33,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:33,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:33,593 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:34:33,595 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:34:33,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:34:33,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:34:33,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:33,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:33,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 22:34:33,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:33,770 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:33,774 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 1 case distinctions, treesize of input 11 treesize of output 9 [2025-01-09 22:34:33,816 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-01-09 22:34:33,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 12 [2025-01-09 22:34:33,859 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| 1))) is different from true [2025-01-09 22:34:33,896 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-01-09 22:34:33,896 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 19 treesize of output 25 [2025-01-09 22:34:34,118 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2025-01-09 22:34:34,251 INFO L349 Elim1Store]: treesize reduction 50, result has 71.6 percent of original size [2025-01-09 22:34:34,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 156 [2025-01-09 22:35:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2025-01-09 22:35:10,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:35:10,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315436462] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:35:10,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:35:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2025-01-09 22:35:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141945527] [2025-01-09 22:35:10,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:10,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:35:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:10,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:35:10,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=409, Unknown=2, NotChecked=86, Total=600 [2025-01-09 22:35:10,914 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 25 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:35:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:11,734 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2025-01-09 22:35:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:35:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2025-01-09 22:35:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:11,736 INFO L225 Difference]: With dead ends: 200 [2025-01-09 22:35:11,736 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 22:35:11,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=605, Unknown=2, NotChecked=106, Total=870 [2025-01-09 22:35:11,737 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 74 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:11,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1235 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1457 Invalid, 0 Unknown, 427 Unchecked, 0.7s Time] [2025-01-09 22:35:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 22:35:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-01-09 22:35:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 116 states have (on average 1.6810344827586208) internal successors, (195), 186 states have internal predecessors, (195), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:35:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2025-01-09 22:35:11,742 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 37 [2025-01-09 22:35:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:11,743 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2025-01-09 22:35:11,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:35:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2025-01-09 22:35:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:35:11,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:11,743 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] [2025-01-09 22:35:11,754 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:35:11,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 22:35:11,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:35:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1534934144, now seen corresponding path program 1 times [2025-01-09 22:35:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741219500] [2025-01-09 22:35:11,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:11,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:35:11,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:35:11,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:11,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741219500] [2025-01-09 22:35:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741219500] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316013642] [2025-01-09 22:35:12,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:12,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:12,534 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:35:12,536 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:35:12,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:35:12,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:35:12,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:12,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:12,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 22:35:12,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:12,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:12,670 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-01-09 22:35:12,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 16 [2025-01-09 22:35:12,678 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 42 treesize of output 38 [2025-01-09 22:35:12,722 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 22:35:12,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 10 [2025-01-09 22:35:12,728 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-01-09 22:35:12,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:12,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:12,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:12,770 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 22:35:12,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 25 [2025-01-09 22:35:12,853 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 22:35:12,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 10 [2025-01-09 22:35:12,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:12,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:12,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:12,896 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 22:35:12,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 25 [2025-01-09 22:35:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:35:12,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:35:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316013642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:35:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-01-09 22:35:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21777432] [2025-01-09 22:35:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:12,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:35:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:12,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:35:12,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=136, Unknown=1, NotChecked=24, Total=210 [2025-01-09 22:35:12,938 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:35:13,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:13,227 INFO L93 Difference]: Finished difference Result 206 states and 230 transitions. [2025-01-09 22:35:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:35:13,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 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:35:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:13,230 INFO L225 Difference]: With dead ends: 206 [2025-01-09 22:35:13,230 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 22:35:13,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=1, NotChecked=24, Total=210 [2025-01-09 22:35:13,231 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 53 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:13,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 407 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 356 Invalid, 0 Unknown, 269 Unchecked, 0.3s Time] [2025-01-09 22:35:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 22:35:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2025-01-09 22:35:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 120 states have (on average 1.6666666666666667) internal successors, (200), 190 states have internal predecessors, (200), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:35:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2025-01-09 22:35:13,237 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 37 [2025-01-09 22:35:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:13,237 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2025-01-09 22:35:13,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:35:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2025-01-09 22:35:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:35:13,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:13,240 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:13,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:35:13,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:13,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:35:13,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash 176052018, now seen corresponding path program 1 times [2025-01-09 22:35:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:13,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849238041] [2025-01-09 22:35:13,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:13,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:35:13,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:35:13,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:13,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 22:35:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:14,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849238041] [2025-01-09 22:35:14,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849238041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:14,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751069727] [2025-01-09 22:35:14,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:14,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:14,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:14,276 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:35:14,277 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:35:14,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:35:14,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:35:14,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:14,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:14,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:35:14,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:14,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:14,423 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:35:14,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-01-09 22:35:14,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2025-01-09 22:35:14,451 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:35:14,452 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 19 treesize of output 18 [2025-01-09 22:35:14,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2025-01-09 22:35:14,471 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:14,487 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:35:14,487 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 1 case distinctions, treesize of input 17 treesize of output 18 [2025-01-09 22:35:14,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2025-01-09 22:35:14,583 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2025-01-09 22:35:14,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 118 [2025-01-09 22:35:14,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:14,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 105 [2025-01-09 22:35:14,917 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-01-09 22:35:14,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:15,037 INFO L349 Elim1Store]: treesize reduction 4, result has 94.5 percent of original size [2025-01-09 22:35:15,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 94 treesize of output 148 [2025-01-09 22:35:15,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:15,078 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2025-01-09 22:35:15,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 99 [2025-01-09 22:35:15,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:15,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 48 [2025-01-09 22:35:15,684 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-01-09 22:35:15,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:15,753 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2025-01-09 22:35:15,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 55 [2025-01-09 22:35:15,811 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:35:15,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:15,850 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:35:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2025-01-09 22:35:15,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:15,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751069727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:15,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:15,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-01-09 22:35:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224545066] [2025-01-09 22:35:15,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:15,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:35:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:15,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:35:15,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=235, Unknown=2, NotChecked=66, Total=380 [2025-01-09 22:35:15,934 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 18 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:35:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:16,481 INFO L93 Difference]: Finished difference Result 219 states and 246 transitions. [2025-01-09 22:35:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:35:16,481 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2025-01-09 22:35:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:16,483 INFO L225 Difference]: With dead ends: 219 [2025-01-09 22:35:16,483 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 22:35:16,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=402, Unknown=2, NotChecked=86, Total=600 [2025-01-09 22:35:16,483 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 167 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:16,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 391 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 562 Invalid, 0 Unknown, 442 Unchecked, 0.4s Time] [2025-01-09 22:35:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 22:35:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2025-01-09 22:35:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 116 states have (on average 1.6724137931034482) internal successors, (194), 185 states have internal predecessors, (194), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:35:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2025-01-09 22:35:16,491 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 52 [2025-01-09 22:35:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:16,491 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2025-01-09 22:35:16,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:35:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2025-01-09 22:35:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:35:16,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:16,492 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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:35:16,501 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:35:16,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:16,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:35:16,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 393532979, now seen corresponding path program 1 times [2025-01-09 22:35:16,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:16,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403272312] [2025-01-09 22:35:16,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:16,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:16,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:35:16,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:35:16,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:16,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:35:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403272312] [2025-01-09 22:35:16,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403272312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:16,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:16,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:35:16,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401357511] [2025-01-09 22:35:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:16,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:35:16,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:16,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:35:16,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:35:16,932 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:35:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:17,263 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2025-01-09 22:35:17,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:35:17,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 58 [2025-01-09 22:35:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:17,264 INFO L225 Difference]: With dead ends: 203 [2025-01-09 22:35:17,265 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 22:35:17,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:35:17,265 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 175 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:17,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 442 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:35:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 22:35:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2025-01-09 22:35:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 178 states have internal predecessors, (187), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:35:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2025-01-09 22:35:17,272 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 58 [2025-01-09 22:35:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:17,272 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2025-01-09 22:35:17,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:35:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2025-01-09 22:35:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:35:17,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:17,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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:35:17,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:35:17,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:35:17,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash 393532980, now seen corresponding path program 1 times [2025-01-09 22:35:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993859618] [2025-01-09 22:35:17,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:17,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:35:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:35:17,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:35:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:17,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993859618] [2025-01-09 22:35:17,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993859618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:17,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:17,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:35:17,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174594179] [2025-01-09 22:35:17,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:17,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:35:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:17,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:35:17,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:35:17,530 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:35:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:18,031 INFO L93 Difference]: Finished difference Result 296 states and 334 transitions. [2025-01-09 22:35:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:35:18,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 58 [2025-01-09 22:35:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:18,033 INFO L225 Difference]: With dead ends: 296 [2025-01-09 22:35:18,033 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 22:35:18,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:35:18,033 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 145 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:18,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 399 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:35:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 22:35:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 253. [2025-01-09 22:35:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 171 states have (on average 1.6374269005847952) internal successors, (280), 233 states have internal predecessors, (280), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 22:35:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 318 transitions. [2025-01-09 22:35:18,047 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 318 transitions. Word has length 58 [2025-01-09 22:35:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:18,047 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 318 transitions. [2025-01-09 22:35:18,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:35:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 318 transitions. [2025-01-09 22:35:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:35:18,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:18,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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:35:18,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:35:18,048 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:35:18,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash -685379307, now seen corresponding path program 1 times [2025-01-09 22:35:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:18,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276745388] [2025-01-09 22:35:18,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:18,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:18,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:35:18,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:35:18,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:18,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:35:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276745388] [2025-01-09 22:35:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276745388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:18,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:35:18,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318391383] [2025-01-09 22:35:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:18,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:35:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:18,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:35:18,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:35:18,346 INFO L87 Difference]: Start difference. First operand 253 states and 318 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:35:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:18,731 INFO L93 Difference]: Finished difference Result 257 states and 317 transitions. [2025-01-09 22:35:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:35:18,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-01-09 22:35:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:18,732 INFO L225 Difference]: With dead ends: 257 [2025-01-09 22:35:18,732 INFO L226 Difference]: Without dead ends: 257 [2025-01-09 22:35:18,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:35:18,733 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 153 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:18,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 494 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:35:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-09 22:35:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 246. [2025-01-09 22:35:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 171 states have (on average 1.5614035087719298) internal successors, (267), 226 states have internal predecessors, (267), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 22:35:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 305 transitions. [2025-01-09 22:35:18,737 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 305 transitions. Word has length 59 [2025-01-09 22:35:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:18,737 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 305 transitions. [2025-01-09 22:35:18,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:35:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 305 transitions. [2025-01-09 22:35:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:35:18,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:18,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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:35:18,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:35:18,738 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:35:18,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash -685379306, now seen corresponding path program 1 times [2025-01-09 22:35:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158101382] [2025-01-09 22:35:18,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:18,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:35:18,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:35:18,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:18,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158101382] [2025-01-09 22:35:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158101382] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945732157] [2025-01-09 22:35:19,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:19,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:19,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:19,073 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:35:19,074 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:35:19,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:35:19,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:35:19,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:19,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:19,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 22:35:19,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:19,237 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:35:19,238 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 1 case distinctions, treesize of input 9 treesize of output 11 [2025-01-09 22:35:19,249 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-01-09 22:35:19,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2025-01-09 22:35:19,257 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-01-09 22:35:19,257 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 1 case distinctions, treesize of input 9 treesize of output 1 [2025-01-09 22:35:19,280 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:35:19,280 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 7 [2025-01-09 22:35:19,285 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-01-09 22:35:19,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:19,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:19,321 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:35:19,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-01-09 22:35:19,363 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:35:19,363 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 7 [2025-01-09 22:35:19,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:19,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:19,421 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:35:19,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-01-09 22:35:19,463 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:35:19,463 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 7 [2025-01-09 22:35:19,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:19,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:19,500 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:35:19,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-01-09 22:35:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 22:35:19,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:35:19,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945732157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:19,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:35:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-01-09 22:35:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476938898] [2025-01-09 22:35:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:19,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:35:19,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:19,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:35:19,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2025-01-09 22:35:19,539 INFO L87 Difference]: Start difference. First operand 246 states and 305 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:35:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:19,795 INFO L93 Difference]: Finished difference Result 270 states and 304 transitions. [2025-01-09 22:35:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:35:19,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 59 [2025-01-09 22:35:19,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:19,800 INFO L225 Difference]: With dead ends: 270 [2025-01-09 22:35:19,800 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 22:35:19,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2025-01-09 22:35:19,801 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 127 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:19,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 284 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 406 Invalid, 0 Unknown, 342 Unchecked, 0.2s Time] [2025-01-09 22:35:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 22:35:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 247. [2025-01-09 22:35:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 172 states have (on average 1.5232558139534884) internal successors, (262), 227 states have internal predecessors, (262), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 22:35:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 300 transitions. [2025-01-09 22:35:19,809 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 300 transitions. Word has length 59 [2025-01-09 22:35:19,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:19,809 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 300 transitions. [2025-01-09 22:35:19,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:35:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 300 transitions. [2025-01-09 22:35:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:35:19,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:19,815 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:19,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:35:20,015 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,SelfDestructingSolverStorable15 [2025-01-09 22:35:20,016 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-01-09 22:35:20,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1658389792, now seen corresponding path program 1 times [2025-01-09 22:35:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660802908] [2025-01-09 22:35:20,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:20,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 22:35:20,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:35:20,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:20,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:35:20,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:20,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660802908] [2025-01-09 22:35:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660802908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:20,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359343209] [2025-01-09 22:35:20,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:20,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:20,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:20,308 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:35:20,317 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:35:20,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 22:35:20,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:35:20,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:20,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:20,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:35:20,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:20,599 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 15 treesize of output 1 [2025-01-09 22:35:20,711 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:20,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:20,714 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 16 treesize of output 11 [2025-01-09 22:35:20,755 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 15 treesize of output 1 [2025-01-09 22:35:21,039 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:21,040 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:21,049 INFO L349 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2025-01-09 22:35:21,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 23 [2025-01-09 22:35:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:35:21,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:21,189 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 26 [2025-01-09 22:35:21,296 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 18 treesize of output 16 [2025-01-09 22:35:21,298 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 26 treesize of output 24 [2025-01-09 22:35:21,360 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 26 [2025-01-09 22:35:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:35:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359343209] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:35:21,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:35:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 17] total 37 [2025-01-09 22:35:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595481697] [2025-01-09 22:35:21,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:21,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:35:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:21,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:35:21,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 22:35:21,573 INFO L87 Difference]: Start difference. First operand 247 states and 300 transitions. Second operand has 37 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 35 states have internal predecessors, (120), 8 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:35:25,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:35:29,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:35:33,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:35:37,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:35:41,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:35:45,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:35:49,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:35:53,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:35:57,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:36:01,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:36:05,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]