./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:59:12,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:59:12,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:59:12,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:59:12,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:59:12,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:59:12,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:59:12,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:59:12,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:59:12,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:59:12,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:59:12,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:59:12,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:59:12,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:59:12,209 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:59:12,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:59:12,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:59:12,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:59:12,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:59:12,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:59:12,209 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:59:12,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:59:12,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:59:12,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:59:12,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:59:12,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:59:12,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:59:12,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:59:12,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:59:12,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:59:12,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:59:12,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:59:12,212 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/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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2025-03-04 07:59:12,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:59:12,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:59:12,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:59:12,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:59:12,481 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:59:12,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2025-03-04 07:59:13,621 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66aa40bb5/e9fb6b4651f74d9d9b47d49efd9f18b3/FLAG5ee767b08 [2025-03-04 07:59:13,873 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:59:13,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2025-03-04 07:59:13,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66aa40bb5/e9fb6b4651f74d9d9b47d49efd9f18b3/FLAG5ee767b08 [2025-03-04 07:59:13,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66aa40bb5/e9fb6b4651f74d9d9b47d49efd9f18b3 [2025-03-04 07:59:13,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:59:13,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:59:13,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:59:13,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:59:13,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:59:13,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:59:13" (1/1) ... [2025-03-04 07:59:13,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e5cd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:13, skipping insertion in model container [2025-03-04 07:59:13,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:59:13" (1/1) ... [2025-03-04 07:59:13,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:59:14,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:59:14,179 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:59:14,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:59:14,226 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:59:14,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14 WrapperNode [2025-03-04 07:59:14,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:59:14,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:59:14,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:59:14,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:59:14,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,259 INFO L138 Inliner]: procedures = 128, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2025-03-04 07:59:14,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:59:14,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:59:14,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:59:14,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:59:14,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,286 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2025-03-04 07:59:14,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:59:14,297 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:59:14,297 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:59:14,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:59:14,298 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (1/1) ... [2025-03-04 07:59:14,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:59:14,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:14,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:59:14,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-04 07:59:14,344 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:59:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:59:14,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:59:14,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:59:14,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:59:14,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:59:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:59:14,452 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:59:14,454 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:59:14,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-04 07:59:14,738 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-04 07:59:14,756 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-04 07:59:14,756 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:59:14,763 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:59:14,764 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:59:14,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:59:14 BoogieIcfgContainer [2025-03-04 07:59:14,764 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:59:14,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:59:14,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:59:14,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:59:14,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:59:13" (1/3) ... [2025-03-04 07:59:14,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f19a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:59:14, skipping insertion in model container [2025-03-04 07:59:14,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:59:14" (2/3) ... [2025-03-04 07:59:14,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f19a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:59:14, skipping insertion in model container [2025-03-04 07:59:14,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:59:14" (3/3) ... [2025-03-04 07:59:14,772 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2025-03-04 07:59:14,781 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:59:14,782 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_unequal.i that has 2 procedures, 100 locations, 1 initial locations, 5 loop locations, and 39 error locations. [2025-03-04 07:59:14,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:59:14,825 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;@320b0d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:59:14,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-04 07:59:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 57 states have (on average 1.894736842105263) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:59:14,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:14,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:14,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:14,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1974046240, now seen corresponding path program 1 times [2025-03-04 07:59:14,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:14,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817228889] [2025-03-04 07:59:14,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:14,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:14,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:59:14,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:59:14,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:14,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817228889] [2025-03-04 07:59:14,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817228889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:14,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:14,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:59:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960420087] [2025-03-04 07:59:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:59:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:15,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:59:15,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:15,019 INFO L87 Difference]: Start difference. First operand has 100 states, 57 states have (on average 1.894736842105263) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-03-04 07:59:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:15,101 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2025-03-04 07:59:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:59:15,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-04 07:59:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:15,107 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:59:15,107 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:59:15,110 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-03-04 07:59:15,112 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:15,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 162 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:59:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 07:59:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2025-03-04 07:59:15,150 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2025-03-04 07:59:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:15,150 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2025-03-04 07:59:15,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-03-04 07:59:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2025-03-04 07:59:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:59:15,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:15,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:15,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:59:15,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:15,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1974046241, now seen corresponding path program 1 times [2025-03-04 07:59:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160918031] [2025-03-04 07:59:15,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:15,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:59:15,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:59:15,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:15,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:15,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:15,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160918031] [2025-03-04 07:59:15,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160918031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:15,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:15,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:59:15,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605383086] [2025-03-04 07:59:15,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:15,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:59:15,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:15,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:59:15,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:15,262 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-03-04 07:59:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:15,320 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2025-03-04 07:59:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:59:15,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-04 07:59:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:15,321 INFO L225 Difference]: With dead ends: 92 [2025-03-04 07:59:15,322 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 07:59:15,322 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-03-04 07:59:15,322 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:15,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 161 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 07:59:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 07:59:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2025-03-04 07:59:15,328 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 7 [2025-03-04 07:59:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:15,328 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2025-03-04 07:59:15,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-03-04 07:59:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2025-03-04 07:59:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:59:15,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:15,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:15,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:59:15,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:15,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:15,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1285971903, now seen corresponding path program 1 times [2025-03-04 07:59:15,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:15,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517936486] [2025-03-04 07:59:15,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:15,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:15,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:59:15,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:59:15,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:15,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:15,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517936486] [2025-03-04 07:59:15,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517936486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:15,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:15,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:59:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948637702] [2025-03-04 07:59:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:15,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:59:15,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:15,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:59:15,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:15,432 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:59:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:15,570 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2025-03-04 07:59:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:15,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-04 07:59:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:15,572 INFO L225 Difference]: With dead ends: 91 [2025-03-04 07:59:15,572 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 07:59:15,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:15,573 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:15,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 309 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 07:59:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 07:59:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2025-03-04 07:59:15,581 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2025-03-04 07:59:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:15,583 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2025-03-04 07:59:15,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:59:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2025-03-04 07:59:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:59:15,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:15,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:15,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:59:15,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:15,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1285971902, now seen corresponding path program 1 times [2025-03-04 07:59:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598960688] [2025-03-04 07:59:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:15,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:59:15,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:59:15,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:15,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:15,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:15,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598960688] [2025-03-04 07:59:15,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598960688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:15,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:15,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:59:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820716364] [2025-03-04 07:59:15,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:15,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:59:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:15,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:59:15,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:15,729 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:59:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:15,864 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2025-03-04 07:59:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:15,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-04 07:59:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:15,866 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:59:15,866 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:59:15,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:15,866 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:15,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:59:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 07:59:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-03-04 07:59:15,871 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 13 [2025-03-04 07:59:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:15,871 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-03-04 07:59:15,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:59:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-03-04 07:59:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:59:15,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:15,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:59:15,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 607840981, now seen corresponding path program 1 times [2025-03-04 07:59:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678498177] [2025-03-04 07:59:15,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:15,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:59:15,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:59:15,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:15,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:15,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:15,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678498177] [2025-03-04 07:59:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678498177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:15,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:15,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:59:15,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285872055] [2025-03-04 07:59:15,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:15,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:59:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:15,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:59:15,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:15,939 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03-04 07:59:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:15,949 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-03-04 07:59:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:59:15,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-03-04 07:59:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:15,950 INFO L225 Difference]: With dead ends: 95 [2025-03-04 07:59:15,950 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 07:59:15,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:15,950 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:15,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 07:59:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2025-03-04 07:59:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2025-03-04 07:59:15,959 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 14 [2025-03-04 07:59:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:15,959 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2025-03-04 07:59:15,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03-04 07:59:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2025-03-04 07:59:15,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:59:15,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:15,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:15,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:59:15,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:15,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1442188217, now seen corresponding path program 1 times [2025-03-04 07:59:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140536084] [2025-03-04 07:59:15,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:15,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:59:15,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:59:15,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:15,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:59:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140536084] [2025-03-04 07:59:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140536084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351439221] [2025-03-04 07:59:16,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:16,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:16,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:16,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:16,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:59:16,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:59:16,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:59:16,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:16,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:16,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:59:16,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:16,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:59:16,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351439221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:16,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:16,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-04 07:59:16,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476986874] [2025-03-04 07:59:16,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:16,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:59:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:16,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:59:16,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:59:16,212 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:59:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:16,223 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-03-04 07:59:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:59:16,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-03-04 07:59:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:16,224 INFO L225 Difference]: With dead ends: 96 [2025-03-04 07:59:16,224 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 07:59:16,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:59:16,225 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:16,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 190 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 07:59:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 07:59:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.694915254237288) internal successors, (100), 91 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-03-04 07:59:16,231 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 26 [2025-03-04 07:59:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:16,231 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-03-04 07:59:16,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:59:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-03-04 07:59:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:59:16,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:16,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:16,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:59:16,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:59:16,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:16,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1800210787, now seen corresponding path program 2 times [2025-03-04 07:59:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346552338] [2025-03-04 07:59:16,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:59:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:16,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 07:59:16,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:59:16,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:59:16,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:59:16,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:16,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346552338] [2025-03-04 07:59:16,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346552338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:16,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449324357] [2025-03-04 07:59:16,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:59:16,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:16,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:16,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:16,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:59:16,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 07:59:17,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:59:17,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:59:17,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:17,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:59:17,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:17,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:59:17,078 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-03-04 07:59:17,106 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:59:17,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:59:17,147 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:59:17,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:59:17,209 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:59:17,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:59:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 6 not checked. [2025-03-04 07:59:17,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:59:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449324357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:17,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 5] total 15 [2025-03-04 07:59:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167363398] [2025-03-04 07:59:17,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:17,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:59:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:17,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:59:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:59:17,612 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 07:59:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:17,832 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2025-03-04 07:59:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:59:17,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2025-03-04 07:59:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:17,833 INFO L225 Difference]: With dead ends: 108 [2025-03-04 07:59:17,833 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 07:59:17,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 11 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=232, Unknown=1, NotChecked=32, Total=342 [2025-03-04 07:59:17,834 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 171 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:17,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 292 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 273 Invalid, 0 Unknown, 106 Unchecked, 0.2s Time] [2025-03-04 07:59:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 07:59:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2025-03-04 07:59:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-03-04 07:59:17,837 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 38 [2025-03-04 07:59:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:17,837 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-03-04 07:59:17,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 07:59:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-03-04 07:59:17,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:59:17,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:17,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:17,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:18,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 07:59:18,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:18,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1800210786, now seen corresponding path program 1 times [2025-03-04 07:59:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061464932] [2025-03-04 07:59:18,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:18,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:59:18,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:59:18,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:18,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:18,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:18,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061464932] [2025-03-04 07:59:18,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061464932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:18,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898396740] [2025-03-04 07:59:18,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:18,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:18,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:18,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:18,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:59:18,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:59:18,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:59:18,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:18,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:18,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:59:18,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:18,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:59:18,724 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-03-04 07:59:18,734 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-03-04 07:59:18,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:18,781 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-03-04 07:59:18,808 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-03-04 07:59:18,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:18,848 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-03-04 07:59:18,889 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-03-04 07:59:18,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:18,922 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-03-04 07:59:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:18,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:59:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898396740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:18,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:59:18,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-03-04 07:59:18,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032160370] [2025-03-04 07:59:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:18,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:59:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:18,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:59:18,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:59:18,928 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:19,007 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2025-03-04 07:59:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:59:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-04 07:59:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:19,008 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:59:19,008 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:59:19,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2025-03-04 07:59:19,009 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 17 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:19,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 230 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 121 Unchecked, 0.1s Time] [2025-03-04 07:59:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:59:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-04 07:59:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-03-04 07:59:19,012 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 38 [2025-03-04 07:59:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:19,012 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-03-04 07:59:19,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2025-03-04 07:59:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:59:19,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:19,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:19,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:59:19,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:19,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:19,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1177130141, now seen corresponding path program 1 times [2025-03-04 07:59:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305480681] [2025-03-04 07:59:19,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:19,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:59:19,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:59:19,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:59:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305480681] [2025-03-04 07:59:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305480681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115713931] [2025-03-04 07:59:19,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:19,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:19,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:19,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:19,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:59:19,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:59:19,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:59:19,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:19,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:19,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 07:59:19,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:19,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:59:19,723 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 9 treesize of output 3 [2025-03-04 07:59:19,729 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-04 07:59:19,764 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-04 07:59:19,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 07:59:19,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:59:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2025-03-04 07:59:19,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:19,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115713931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:19,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2025-03-04 07:59:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851593406] [2025-03-04 07:59:19,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:19,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:59:19,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:19,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:59:19,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=406, Unknown=1, NotChecked=40, Total=506 [2025-03-04 07:59:19,825 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 19 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:20,266 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2025-03-04 07:59:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:59:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 19 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-04 07:59:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:20,267 INFO L225 Difference]: With dead ends: 107 [2025-03-04 07:59:20,267 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 07:59:20,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=763, Unknown=1, NotChecked=56, Total=930 [2025-03-04 07:59:20,268 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 120 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:20,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 754 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 770 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2025-03-04 07:59:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 07:59:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2025-03-04 07:59:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2025-03-04 07:59:20,275 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 41 [2025-03-04 07:59:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:20,275 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2025-03-04 07:59:20,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 19 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2025-03-04 07:59:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:59:20,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:20,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:20,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:59:20,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:20,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:20,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1177130142, now seen corresponding path program 1 times [2025-03-04 07:59:20,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286554401] [2025-03-04 07:59:20,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:20,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:59:20,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:59:20,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:20,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:20,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:20,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286554401] [2025-03-04 07:59:20,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286554401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:20,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963087658] [2025-03-04 07:59:20,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:20,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:20,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:20,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:20,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:59:20,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:59:20,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:59:20,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:20,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:20,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-04 07:59:20,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:20,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:59:21,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:59:21,222 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 9 treesize of output 3 [2025-03-04 07:59:21,224 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 9 treesize of output 3 [2025-03-04 07:59:21,256 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-03-04 07:59:21,291 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:59:21,291 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 15 treesize of output 15 [2025-03-04 07:59:21,294 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 18 treesize of output 13 [2025-03-04 07:59:21,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:59:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2025-03-04 07:59:21,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:21,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963087658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:21,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:21,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2025-03-04 07:59:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938683082] [2025-03-04 07:59:21,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:21,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:59:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:21,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:59:21,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=908, Unknown=1, NotChecked=60, Total=1056 [2025-03-04 07:59:21,627 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 28 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 24 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:22,678 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2025-03-04 07:59:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:59:22,678 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 24 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-04 07:59:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:22,679 INFO L225 Difference]: With dead ends: 118 [2025-03-04 07:59:22,679 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 07:59:22,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=2144, Unknown=1, NotChecked=94, Total=2450 [2025-03-04 07:59:22,680 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 136 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:22,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 925 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1181 Invalid, 0 Unknown, 120 Unchecked, 0.6s Time] [2025-03-04 07:59:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 07:59:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2025-03-04 07:59:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.537313432835821) internal successors, (103), 93 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-03-04 07:59:22,685 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 41 [2025-03-04 07:59:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:22,685 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-03-04 07:59:22,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 24 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-03-04 07:59:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:59:22,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:22,686 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:22,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:59:22,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 07:59:22,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:22,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:22,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2131296918, now seen corresponding path program 1 times [2025-03-04 07:59:22,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419521033] [2025-03-04 07:59:22,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:22,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:22,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:59:22,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:59:22,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:22,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419521033] [2025-03-04 07:59:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419521033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:22,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:22,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:59:22,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352201484] [2025-03-04 07:59:22,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:22,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:59:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:22,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:59:22,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:22,934 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:22,943 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-03-04 07:59:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:59:22,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-04 07:59:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:22,944 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:59:22,944 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:59:22,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:22,944 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:22,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:59:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 07:59:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-03-04 07:59:22,947 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 42 [2025-03-04 07:59:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:22,947 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-03-04 07:59:22,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-03-04 07:59:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:59:22,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:22,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:22,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:59:22,948 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1645696116, now seen corresponding path program 1 times [2025-03-04 07:59:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873624638] [2025-03-04 07:59:22,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:22,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:59:22,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:59:22,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:22,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 07:59:23,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873624638] [2025-03-04 07:59:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873624638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:23,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:59:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538619958] [2025-03-04 07:59:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:59:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:23,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:59:23,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:23,014 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:23,092 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-03-04 07:59:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:23,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-03-04 07:59:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:23,093 INFO L225 Difference]: With dead ends: 99 [2025-03-04 07:59:23,093 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 07:59:23,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:23,094 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 10 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:23,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 278 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 07:59:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 07:59:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 93 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-03-04 07:59:23,096 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 43 [2025-03-04 07:59:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:23,096 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-03-04 07:59:23,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-03-04 07:59:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:59:23,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:23,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:23,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:59:23,097 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:23,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1645696117, now seen corresponding path program 1 times [2025-03-04 07:59:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:23,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550544278] [2025-03-04 07:59:23,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:23,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:59:23,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:59:23,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:23,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:23,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550544278] [2025-03-04 07:59:23,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550544278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:23,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:23,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:59:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460445802] [2025-03-04 07:59:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:23,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:59:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:23,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:59:23,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:59:23,170 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:23,186 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2025-03-04 07:59:23,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:59:23,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-04 07:59:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:23,187 INFO L225 Difference]: With dead ends: 102 [2025-03-04 07:59:23,187 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 07:59:23,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:59:23,188 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:23,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 07:59:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-03-04 07:59:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.507462686567164) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-03-04 07:59:23,191 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 43 [2025-03-04 07:59:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:23,191 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-03-04 07:59:23,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-03-04 07:59:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:59:23,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:23,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:23,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:59:23,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:23,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash -523886569, now seen corresponding path program 1 times [2025-03-04 07:59:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:23,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976639267] [2025-03-04 07:59:23,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:23,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:23,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:59:23,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:59:23,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:23,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:59:23,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:23,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976639267] [2025-03-04 07:59:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976639267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:23,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774392489] [2025-03-04 07:59:23,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:23,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:23,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:23,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:23,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:59:23,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:59:23,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:59:23,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:23,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:23,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:59:23,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:23,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:59:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774392489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:23,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:59:23,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-03-04 07:59:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74158350] [2025-03-04 07:59:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:23,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:59:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:23,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:59:23,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:23,484 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:23,503 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-03-04 07:59:23,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:59:23,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-03-04 07:59:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:23,505 INFO L225 Difference]: With dead ends: 99 [2025-03-04 07:59:23,505 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 07:59:23,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:59:23,506 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:23,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 07:59:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-03-04 07:59:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2025-03-04 07:59:23,509 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 44 [2025-03-04 07:59:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2025-03-04 07:59:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2025-03-04 07:59:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:59:23,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:23,511 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:23,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:23,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:23,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:23,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash 939386460, now seen corresponding path program 1 times [2025-03-04 07:59:23,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:23,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400933189] [2025-03-04 07:59:23,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:23,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:23,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:23,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:23,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400933189] [2025-03-04 07:59:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400933189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:23,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:59:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421451507] [2025-03-04 07:59:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:59:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:23,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:59:23,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:59:23,774 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:23,825 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2025-03-04 07:59:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:59:23,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-04 07:59:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:23,826 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:59:23,826 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:59:23,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:59:23,826 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:23,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:59:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 07:59:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 88 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2025-03-04 07:59:23,830 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 45 [2025-03-04 07:59:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:23,830 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2025-03-04 07:59:23,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2025-03-04 07:59:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:59:23,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:23,831 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:23,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:59:23,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 939386461, now seen corresponding path program 1 times [2025-03-04 07:59:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184379144] [2025-03-04 07:59:23,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:23,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:23,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:23,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:23,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:59:24,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:24,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184379144] [2025-03-04 07:59:24,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184379144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:24,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588852216] [2025-03-04 07:59:24,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:24,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:24,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:24,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:59:24,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:24,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:24,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:24,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:59:24,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:24,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:59:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:24,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:59:24,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588852216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:24,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:59:24,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2025-03-04 07:59:24,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261157039] [2025-03-04 07:59:24,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:24,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:59:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:24,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:59:24,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:59:24,206 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:24,247 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2025-03-04 07:59:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:59:24,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-04 07:59:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:24,248 INFO L225 Difference]: With dead ends: 93 [2025-03-04 07:59:24,248 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 07:59:24,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:59:24,248 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:24,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 07:59:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 07:59:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2025-03-04 07:59:24,251 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 45 [2025-03-04 07:59:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:24,251 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2025-03-04 07:59:24,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2025-03-04 07:59:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:59:24,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:24,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:24,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:24,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:24,457 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:24,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash -943790767, now seen corresponding path program 1 times [2025-03-04 07:59:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958607371] [2025-03-04 07:59:24,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:24,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:59:24,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:59:24,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:24,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:59:24,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:24,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958607371] [2025-03-04 07:59:24,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958607371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:24,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:24,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:59:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741214986] [2025-03-04 07:59:24,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:24,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:59:24,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:24,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:59:24,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:59:24,589 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:24,654 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2025-03-04 07:59:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-03-04 07:59:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:24,655 INFO L225 Difference]: With dead ends: 92 [2025-03-04 07:59:24,655 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 07:59:24,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:59:24,656 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:24,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 301 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 07:59:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 07:59:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 86 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2025-03-04 07:59:24,658 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 46 [2025-03-04 07:59:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:24,658 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2025-03-04 07:59:24,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2025-03-04 07:59:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:59:24,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:24,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:24,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:59:24,658 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:24,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -744827218, now seen corresponding path program 1 times [2025-03-04 07:59:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:24,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243444870] [2025-03-04 07:59:24,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:24,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:59:24,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:59:24,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:24,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 07:59:24,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243444870] [2025-03-04 07:59:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243444870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:24,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:24,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:59:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546409050] [2025-03-04 07:59:24,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:24,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:59:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:24,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:59:24,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:24,775 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:24,833 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2025-03-04 07:59:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:24,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2025-03-04 07:59:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:24,834 INFO L225 Difference]: With dead ends: 92 [2025-03-04 07:59:24,834 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 07:59:24,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:59:24,835 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 52 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:24,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 207 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 07:59:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-03-04 07:59:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.393939393939394) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-03-04 07:59:24,837 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 48 [2025-03-04 07:59:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-03-04 07:59:24,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-03-04 07:59:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:59:24,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:24,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:24,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:59:24,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:24,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1346591433, now seen corresponding path program 1 times [2025-03-04 07:59:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:24,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726157839] [2025-03-04 07:59:24,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:24,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:24,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:24,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:24,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:24,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:24,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726157839] [2025-03-04 07:59:24,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726157839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:24,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480990566] [2025-03-04 07:59:24,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:24,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:24,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:24,960 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:24,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:59:25,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:25,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:25,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:25,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:25,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:59:25,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:25,143 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 9 treesize of output 3 [2025-03-04 07:59:25,154 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-04 07:59:25,186 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-04 07:59:25,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 07:59:25,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:59:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:59:25,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:59:25,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480990566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:25,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:59:25,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 12 [2025-03-04 07:59:25,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539705331] [2025-03-04 07:59:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:25,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:25,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:25,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=112, Unknown=1, NotChecked=20, Total=156 [2025-03-04 07:59:25,205 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:25,355 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2025-03-04 07:59:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:59:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-03-04 07:59:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:25,356 INFO L225 Difference]: With dead ends: 131 [2025-03-04 07:59:25,356 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 07:59:25,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2025-03-04 07:59:25,357 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 63 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:25,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 306 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 305 Invalid, 0 Unknown, 188 Unchecked, 0.1s Time] [2025-03-04 07:59:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 07:59:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 94. [2025-03-04 07:59:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.356164383561644) internal successors, (99), 88 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2025-03-04 07:59:25,359 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 51 [2025-03-04 07:59:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:25,359 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2025-03-04 07:59:25,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2025-03-04 07:59:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:59:25,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:25,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:25,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:59:25,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:25,562 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:25,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1346591432, now seen corresponding path program 1 times [2025-03-04 07:59:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884190976] [2025-03-04 07:59:25,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:25,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:25,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:25,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:25,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:25,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:59:25,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884190976] [2025-03-04 07:59:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884190976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611403178] [2025-03-04 07:59:25,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:25,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:25,879 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:25,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:59:25,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:26,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:26,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:26,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:26,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:59:26,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:26,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:59:26,232 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 9 treesize of output 3 [2025-03-04 07:59:26,235 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 9 treesize of output 3 [2025-03-04 07:59:26,276 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|))) (and (<= 0 (+ .cse0 4)) (<= .cse0 0)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-03-04 07:59:26,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:26,315 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 18 treesize of output 13 [2025-03-04 07:59:26,320 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:59:26,321 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 15 treesize of output 15 [2025-03-04 07:59:26,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:59:26,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:26,471 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 40 treesize of output 32 [2025-03-04 07:59:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2025-03-04 07:59:26,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:26,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611403178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:26,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:26,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2025-03-04 07:59:26,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412578164] [2025-03-04 07:59:26,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:26,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:59:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:26,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:59:26,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=918, Unknown=1, NotChecked=60, Total=1056 [2025-03-04 07:59:26,731 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:59:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:27,555 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2025-03-04 07:59:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:59:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2025-03-04 07:59:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:27,556 INFO L225 Difference]: With dead ends: 131 [2025-03-04 07:59:27,556 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 07:59:27,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=2251, Unknown=1, NotChecked=96, Total=2550 [2025-03-04 07:59:27,557 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 190 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:27,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 997 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1170 Invalid, 0 Unknown, 135 Unchecked, 0.5s Time] [2025-03-04 07:59:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 07:59:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2025-03-04 07:59:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 92 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2025-03-04 07:59:27,560 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 51 [2025-03-04 07:59:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:27,560 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2025-03-04 07:59:27,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:59:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2025-03-04 07:59:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:59:27,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:27,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:27,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:27,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:27,761 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:27,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1236237351, now seen corresponding path program 1 times [2025-03-04 07:59:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877951663] [2025-03-04 07:59:27,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:27,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:27,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:27,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:27,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:59:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:27,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877951663] [2025-03-04 07:59:27,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877951663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:27,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:27,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:59:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511346455] [2025-03-04 07:59:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:27,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:27,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:27,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:27,909 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:28,107 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2025-03-04 07:59:28,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:59:28,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-03-04 07:59:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:28,108 INFO L225 Difference]: With dead ends: 138 [2025-03-04 07:59:28,108 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 07:59:28,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:59:28,108 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 56 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:28,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 530 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:59:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 07:59:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2025-03-04 07:59:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.35) internal successors, (108), 95 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-03-04 07:59:28,112 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 51 [2025-03-04 07:59:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:28,112 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-03-04 07:59:28,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-03-04 07:59:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:59:28,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:28,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:28,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:59:28,113 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:28,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1236237350, now seen corresponding path program 1 times [2025-03-04 07:59:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045956385] [2025-03-04 07:59:28,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:28,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:28,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:28,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:28,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:59:28,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045956385] [2025-03-04 07:59:28,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045956385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670966262] [2025-03-04 07:59:28,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:28,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:28,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:28,307 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:28,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:59:28,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:28,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:28,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:28,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:28,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 07:59:28,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:28,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:59:28,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:59:28,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:59:28,710 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:59:28,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:59:28,714 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:59:28,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:28,716 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 17 treesize of output 12 [2025-03-04 07:59:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:59:28,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:59:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670966262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:28,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:59:28,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-03-04 07:59:28,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700024284] [2025-03-04 07:59:28,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:28,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:59:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:28,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:59:28,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:59:28,747 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 12 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:28,977 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2025-03-04 07:59:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:59:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-03-04 07:59:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:28,981 INFO L225 Difference]: With dead ends: 138 [2025-03-04 07:59:28,981 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 07:59:28,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:59:28,982 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 95 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:28,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 614 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:59:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 07:59:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 94. [2025-03-04 07:59:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 88 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2025-03-04 07:59:28,987 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 51 [2025-03-04 07:59:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:28,987 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2025-03-04 07:59:28,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2025-03-04 07:59:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 07:59:28,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:28,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:28,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:29,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 07:59:29,189 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:29,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:29,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1963084258, now seen corresponding path program 1 times [2025-03-04 07:59:29,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:29,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99525141] [2025-03-04 07:59:29,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:29,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:29,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 07:59:29,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 07:59:29,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:29,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:59:29,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99525141] [2025-03-04 07:59:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99525141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003820726] [2025-03-04 07:59:29,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:29,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:29,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:59:29,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 07:59:29,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 07:59:29,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:29,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:29,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:59:29,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:29,738 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-03-04 07:59:29,755 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2025-03-04 07:59:29,771 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-03-04 07:59:29,803 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-03-04 07:59:29,848 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-03-04 07:59:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:29,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:30,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003820726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:30,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:30,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 23 [2025-03-04 07:59:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432346804] [2025-03-04 07:59:30,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:30,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:59:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:30,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:59:30,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=631, Unknown=1, NotChecked=50, Total=756 [2025-03-04 07:59:30,138 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:59:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:30,674 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2025-03-04 07:59:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:59:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 55 [2025-03-04 07:59:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:30,675 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:59:30,675 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 07:59:30,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=1895, Unknown=1, NotChecked=90, Total=2256 [2025-03-04 07:59:30,676 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 175 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:30,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 562 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 764 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2025-03-04 07:59:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 07:59:30,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2025-03-04 07:59:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.318840579710145) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2025-03-04 07:59:30,678 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 55 [2025-03-04 07:59:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:30,678 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2025-03-04 07:59:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:59:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2025-03-04 07:59:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:59:30,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:30,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:30,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:30,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:59:30,879 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1256447642, now seen corresponding path program 1 times [2025-03-04 07:59:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572274572] [2025-03-04 07:59:30,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:30,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:59:30,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:59:30,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:30,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:31,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572274572] [2025-03-04 07:59:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572274572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:31,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285198118] [2025-03-04 07:59:31,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:31,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:31,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:31,609 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:31,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:59:31,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:59:31,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:59:31,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:31,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:31,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:59:31,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:31,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:59:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285198118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:31,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 8] total 38 [2025-03-04 07:59:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321191446] [2025-03-04 07:59:31,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 07:59:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:32,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 07:59:32,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 07:59:32,000 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:59:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:32,854 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-03-04 07:59:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 07:59:32,855 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 56 [2025-03-04 07:59:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:32,855 INFO L225 Difference]: With dead ends: 91 [2025-03-04 07:59:32,855 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 07:59:32,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=3134, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 07:59:32,856 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 77 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:32,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 992 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:59:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 07:59:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2025-03-04 07:59:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 77 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2025-03-04 07:59:32,858 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 56 [2025-03-04 07:59:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:32,858 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2025-03-04 07:59:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.324324324324324) internal successors, (86), 35 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:59:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2025-03-04 07:59:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:59:32,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:32,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:32,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:59:33,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:59:33,060 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:33,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1256447622, now seen corresponding path program 1 times [2025-03-04 07:59:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:33,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499845888] [2025-03-04 07:59:33,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:33,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:59:33,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:59:33,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:33,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:33,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499845888] [2025-03-04 07:59:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499845888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746417262] [2025-03-04 07:59:33,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:33,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:33,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:33,874 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:33,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:59:33,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:59:34,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:59:34,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:34,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-04 07:59:34,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:34,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:59:34,288 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:59:34,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:59:34,293 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-03-04 07:59:34,350 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 19 treesize of output 1 [2025-03-04 07:59:34,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:59:34,522 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 61 treesize of output 19 [2025-03-04 07:59:34,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-03-04 07:59:34,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:59:34,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:59:34,765 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:59:34,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2025-03-04 07:59:34,770 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 11 treesize of output 3 [2025-03-04 07:59:34,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:34,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2025-03-04 07:59:34,788 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-03-04 07:59:34,788 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 34 treesize of output 36 [2025-03-04 07:59:34,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-03-04 07:59:35,009 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-03-04 07:59:35,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 60 [2025-03-04 07:59:35,025 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2025-03-04 07:59:35,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 30 [2025-03-04 07:59:35,161 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-04 07:59:35,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 107 [2025-03-04 07:59:35,174 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-04 07:59:35,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 140 [2025-03-04 07:59:35,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:59:35,499 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 354 treesize of output 266 [2025-03-04 07:59:35,502 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 270 treesize of output 214 [2025-03-04 07:59:35,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:35,846 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 211 treesize of output 127 [2025-03-04 07:59:35,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:35,868 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 121 treesize of output 139 [2025-03-04 07:59:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:59:36,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:36,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2107 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2108) .cse0) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2107) .cse0) .cse1)))) (forall ((v_ArrVal_2108 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2108) .cse0) .cse1))))) is different from false [2025-03-04 07:59:39,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746417262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:39,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 53 [2025-03-04 07:59:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899919315] [2025-03-04 07:59:39,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-04 07:59:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:39,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-04 07:59:39,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3699, Unknown=39, NotChecked=122, Total=4032 [2025-03-04 07:59:39,964 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 54 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 46 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:43,006 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-03-04 07:59:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 07:59:43,007 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 46 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2025-03-04 07:59:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:43,007 INFO L225 Difference]: With dead ends: 92 [2025-03-04 07:59:43,007 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 07:59:43,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=431, Invalid=7543, Unknown=40, NotChecked=176, Total=8190 [2025-03-04 07:59:43,009 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 125 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:43,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1468 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:59:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 07:59:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2025-03-04 07:59:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-03-04 07:59:43,012 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 56 [2025-03-04 07:59:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:43,013 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-03-04 07:59:43,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 46 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-03-04 07:59:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:59:43,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:43,014 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:43,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:59:43,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:59:43,218 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:43,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash -295288319, now seen corresponding path program 1 times [2025-03-04 07:59:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902280772] [2025-03-04 07:59:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:43,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:59:43,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:59:43,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:44,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:44,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902280772] [2025-03-04 07:59:44,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902280772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:44,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272526886] [2025-03-04 07:59:44,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:44,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:44,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:44,086 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:44,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:59:44,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:59:44,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:59:44,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:44,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:44,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-04 07:59:44,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:44,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:59:44,433 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-04 07:59:44,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2025-03-04 07:59:44,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-04 07:59:44,618 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 9 treesize of output 3 [2025-03-04 07:59:44,801 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:59:44,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2025-03-04 07:59:44,813 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:59:44,813 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 15 treesize of output 15 [2025-03-04 07:59:45,216 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 07:59:45,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2025-03-04 07:59:45,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2025-03-04 07:59:45,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-04 07:59:45,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:45,375 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 39 treesize of output 31 [2025-03-04 07:59:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:45,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272526886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:46,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2025-03-04 07:59:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924554412] [2025-03-04 07:59:46,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:46,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:59:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:46,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:59:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3211, Unknown=18, NotChecked=0, Total=3422 [2025-03-04 07:59:46,318 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:47,943 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2025-03-04 07:59:47,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 07:59:47,943 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2025-03-04 07:59:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:47,943 INFO L225 Difference]: With dead ends: 85 [2025-03-04 07:59:47,943 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 07:59:47,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=423, Invalid=6365, Unknown=18, NotChecked=0, Total=6806 [2025-03-04 07:59:47,945 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 81 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:47,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1176 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:59:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 07:59:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-03-04 07:59:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-03-04 07:59:47,947 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 57 [2025-03-04 07:59:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:47,947 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-03-04 07:59:47,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-03-04 07:59:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:59:47,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:47,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:47,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:48,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:48,148 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 36 more)] === [2025-03-04 07:59:48,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1630174515, now seen corresponding path program 1 times [2025-03-04 07:59:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:48,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602021182] [2025-03-04 07:59:48,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:48,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:59:48,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:59:48,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:48,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602021182] [2025-03-04 07:59:49,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602021182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066929748] [2025-03-04 07:59:49,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:49,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:49,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:49,015 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:49,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:59:49,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:59:49,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:59:49,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:49,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:49,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-04 07:59:49,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:49,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:59:49,383 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 9 treesize of output 3 [2025-03-04 07:59:49,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:59:49,550 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:59:49,550 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 15 treesize of output 15 [2025-03-04 07:59:49,868 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 19 treesize of output 11 [2025-03-04 07:59:49,873 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 19 treesize of output 11 [2025-03-04 07:59:49,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:59:49,941 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 07:59:49,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2025-03-04 07:59:49,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-04 07:59:49,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 55 treesize of output 19 [2025-03-04 07:59:50,024 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 50 treesize of output 30 [2025-03-04 07:59:50,118 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 27 treesize of output 15 [2025-03-04 07:59:50,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:59:50,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:59:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:50,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:50,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2413 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2411 (Array Int Int)) (v_ArrVal_2414 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2413) .cse0) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_2414)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2411) .cse0) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))) is different from false [2025-03-04 07:59:50,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:50,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2025-03-04 07:59:50,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:50,600 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 96 treesize of output 95 [2025-03-04 07:59:50,605 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 39 treesize of output 31 [2025-03-04 07:59:50,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:50,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-03-04 07:59:50,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:50,624 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 56 treesize of output 55 [2025-03-04 07:59:50,630 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 21 treesize of output 13 [2025-03-04 07:59:50,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse13)) (.cse10 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse7 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408))) (let ((.cse19 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_2414))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse19) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))))))))) (.cse6 (not .cse2))) (let ((.cse0 (and .cse7 (or .cse2 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_2414) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse15 (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408))) (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_2414))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))))))) (or .cse6 (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408))) (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_2414))) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (or (forall ((v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408))) (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_2414))) v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) .cse2))) (.cse4 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (and (or .cse2 (forall ((v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408) v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (.cse1 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse13))) (and (or .cse0 .cse1) (or .cse2 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (or .cse3 .cse4) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_ArrVal_2408 (Array Int Int))) (let ((.cse5 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408))) (or (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse5 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (or .cse0 .cse4) (or .cse6 (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) (or (let ((.cse8 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408))) (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_2414))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))))) (and .cse7 (or .cse1 .cse8) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2408))) (store .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_ArrVal_2414))) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (or .cse8 .cse4))) .cse6) (or .cse3 .cse1)))))) is different from false [2025-03-04 07:59:52,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse13)) (.cse9 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse7 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408))) (let ((.cse20 (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_2414))) (or (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse20) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))))))) (.cse5 (not .cse2))) (let ((.cse1 (and (or .cse2 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_2414) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) .cse7 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse15 (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408))) (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_2414))))) (or (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (= (select (select .cse15 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse5 (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408))) (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_2414))) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (or (forall ((v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= (select (select (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408))) (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_2414))) v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse2))) (.cse4 (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408))) (or (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (or (forall ((v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408) v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) .cse2))) (.cse0 (= |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| .cse13)) (.cse3 (= |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 .cse1) (or .cse2 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) (or .cse3 .cse1) (or .cse3 .cse4) (or (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) .cse5) (or .cse4 .cse0) (or (let ((.cse6 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse10 (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408))) (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_2414))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (= (select (select .cse10 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (and (or .cse6 .cse0) .cse7 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408))) (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_2414))) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (or .cse3 .cse6))) .cse5) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_ArrVal_2408 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2408))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))))))) is different from false [2025-03-04 07:59:53,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse14))) (let ((.cse4 (not .cse3)) (.cse8 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (forall ((v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| .cse2 v_ArrVal_2408))) (let ((.cse20 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_2414))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse20) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0))))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse0 (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (forall ((v_arrayElimCell_92 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| .cse2 v_ArrVal_2408))) (or (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (= (select (select .cse19 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (or (forall ((v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (= (select (select (store |c_#memory_int#2| .cse2 v_ArrVal_2408) v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse3))) (.cse12 (and (or .cse4 (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse15 (store |c_#memory_int#2| .cse2 v_ArrVal_2408))) (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_2414))) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) .cse8 (or .cse3 (forall ((v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= (select (select (let ((.cse16 (store |c_#memory_int#2| .cse2 v_ArrVal_2408))) (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_2414))) v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse2 v_ArrVal_2408) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_2414) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) .cse3) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store |c_#memory_int#2| .cse2 v_ArrVal_2408))) (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_2414))))) (or (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (= (select (select .cse17 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (.cse9 (= .cse14 .cse2))) (and (or .cse0 .cse1) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| .cse2 v_ArrVal_2408) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) .cse3) (or .cse4 (let ((.cse7 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse10 (let ((.cse11 (store |c_#memory_int#2| .cse2 v_ArrVal_2408))) (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_2414))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (= (select (select .cse10 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse5 (store |c_#memory_int#2| .cse2 v_ArrVal_2408))) (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_2414))) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (or .cse7 .cse1) .cse8 (or .cse7 .cse9)))) (or .cse12 .cse1) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_ArrVal_2408 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| .cse2 v_ArrVal_2408))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (or (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| .cse2 v_ArrVal_2408) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) .cse4) (or .cse0 .cse9) (or .cse12 .cse9)))))) is different from false [2025-03-04 07:59:53,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse12 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse18))) (let ((.cse2 (not .cse12)) (.cse6 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| .cse3 v_ArrVal_2408))) (let ((.cse20 (store (select .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_2414))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse20) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))))))))) (let ((.cse13 (and (or .cse12 (forall ((v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (= (select (select (store |c_#memory_int#2| .cse3 v_ArrVal_2408) v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (forall ((v_arrayElimCell_92 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| .cse3 v_ArrVal_2408))) (or (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))) (= (select (select .cse19 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) |c_ULTIMATE.start_main_~uneq~0#1|)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (.cse1 (= .cse18 .cse3)) (.cse0 (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse14 (let ((.cse15 (store |c_#memory_int#2| .cse3 v_ArrVal_2408))) (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_2414))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))))))) (or (forall ((v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse16 (store |c_#memory_int#2| .cse3 v_ArrVal_2408))) (store .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_2414))) v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) .cse12) (or .cse2 (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse17 (store |c_#memory_int#2| .cse3 v_ArrVal_2408))) (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_2414))) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) .cse6 (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse3 v_ArrVal_2408) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_2414) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) .cse12))) (.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))) (and (or .cse0 .cse1) (or .cse2 (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| .cse3 v_ArrVal_2408) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (or .cse2 (let ((.cse4 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int#2| .cse3 v_ArrVal_2408))) (store .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_2414))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_92) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))))) (and (or .cse4 .cse5) .cse6 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_2414 Int) (v_ArrVal_2408 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse7 (store |c_#memory_int#2| .cse3 v_ArrVal_2408))) (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_2414))) v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) (or .cse4 .cse1)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (forall ((v_ArrVal_2408 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| .cse3 v_ArrVal_2408))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (forall ((v_arrayElimCell_93 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_93) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))))))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2408 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| .cse3 v_ArrVal_2408) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) .cse12) (or .cse13 .cse5) (or .cse13 .cse1) (or .cse0 .cse5)))))) is different from false [2025-03-04 07:59:59,117 WARN L286 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 799 DAG size of output: 751 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-04 07:59:59,117 INFO L349 Elim1Store]: treesize reduction 240, result has 87.0 percent of original size [2025-03-04 07:59:59,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 17 new quantified variables, introduced 137 case distinctions, treesize of input 3158 treesize of output 4163 [2025-03-04 07:59:59,656 INFO L224 Elim1Store]: Index analysis took 115 ms [2025-03-04 08:00:05,359 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 1251 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-04 08:00:05,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:00:05,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 2647 treesize of output 4931 [2025-03-04 08:00:06,492 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 2288 treesize of output 2282 [2025-03-04 08:00:07,654 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 2292 treesize of output 2290 [2025-03-04 08:00:08,750 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 2310 treesize of output 2304 [2025-03-04 08:00:09,865 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 2314 treesize of output 2310 [2025-03-04 08:00:10,970 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 2350 treesize of output 2338 [2025-03-04 08:00:12,087 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 2378 treesize of output 2366 [2025-03-04 08:00:13,219 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 2366 treesize of output 2364 [2025-03-04 08:00:14,359 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 2364 treesize of output 2360 [2025-03-04 08:00:15,494 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 2400 treesize of output 2388 [2025-03-04 08:00:16,647 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 2388 treesize of output 2386 [2025-03-04 08:00:17,803 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 2386 treesize of output 2384 [2025-03-04 08:00:18,940 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 2394 treesize of output 2390 [2025-03-04 08:00:20,057 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 2410 treesize of output 2404 [2025-03-04 08:00:21,224 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 2404 treesize of output 2402 [2025-03-04 08:00:22,399 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 2402 treesize of output 2398 [2025-03-04 08:00:23,574 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 2418 treesize of output 2412 [2025-03-04 08:00:24,731 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 2432 treesize of output 2426 [2025-03-04 08:00:25,898 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 2466 treesize of output 2454 [2025-03-04 08:00:27,075 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 2464 treesize of output 2460 [2025-03-04 08:00:28,280 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 2470 treesize of output 2468 [2025-03-04 08:00:29,470 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 2468 treesize of output 2464