./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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_append_equal.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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:18:27,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:18:27,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:18:27,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:18:27,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:18:27,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:18:27,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:18:27,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:18:27,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:18:27,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:18:27,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:18:27,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:18:27,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:18:27,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:18:27,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:18:27,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:18:27,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:18:27,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:18:27,139 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2025-03-17 12:18:27,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:18:27,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:18:27,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:18:27,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:18:27,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:18:27,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2025-03-17 12:18:28,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2859f8ff/04ea119f2f8343909fac0574e6fbfad2/FLAG5320781bc [2025-03-17 12:18:28,721 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:18:28,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2025-03-17 12:18:28,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2859f8ff/04ea119f2f8343909fac0574e6fbfad2/FLAG5320781bc [2025-03-17 12:18:29,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2859f8ff/04ea119f2f8343909fac0574e6fbfad2 [2025-03-17 12:18:29,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:18:29,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:18:29,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:18:29,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:18:29,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:18:29,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2498cf46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29, skipping insertion in model container [2025-03-17 12:18:29,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:18:29,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:18:29,282 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:18:29,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:18:29,328 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:18:29,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29 WrapperNode [2025-03-17 12:18:29,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:18:29,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:18:29,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:18:29,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:18:29,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,359 INFO L138 Inliner]: procedures = 127, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 116 [2025-03-17 12:18:29,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:18:29,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:18:29,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:18:29,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:18:29,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,381 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2025-03-17 12:18:29,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:18:29,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:18:29,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:18:29,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:18:29,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (1/1) ... [2025-03-17 12:18:29,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:18:29,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:29,421 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-17 12:18:29,423 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-17 12:18:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:18:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:18:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 12:18:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-17 12:18:29,440 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 12:18:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:18:29,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:18:29,542 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:18:29,544 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:18:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: 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-17 12:18:29,748 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:18:29,763 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-17 12:18:29,764 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:18:29,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:18:29,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:18:29,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:18:29 BoogieIcfgContainer [2025-03-17 12:18:29,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:18:29,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:18:29,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:18:29,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:18:29,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:18:29" (1/3) ... [2025-03-17 12:18:29,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bdc851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:18:29, skipping insertion in model container [2025-03-17 12:18:29,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:29" (2/3) ... [2025-03-17 12:18:29,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bdc851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:18:29, skipping insertion in model container [2025-03-17 12:18:29,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:18:29" (3/3) ... [2025-03-17 12:18:29,779 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2025-03-17 12:18:29,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:18:29,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.i that has 2 procedures, 84 locations, 1 initial locations, 4 loop locations, and 33 error locations. [2025-03-17 12:18:29,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:18:29,819 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;@3c1a9c45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:18:29,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-17 12:18:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 80 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:18:29,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:29,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 12:18:29,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:29,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash -893244266, now seen corresponding path program 1 times [2025-03-17 12:18:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642060028] [2025-03-17 12:18:29,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:29,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:18:29,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:18:29,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:29,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:30,033 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-17 12:18:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642060028] [2025-03-17 12:18:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642060028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:30,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:30,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:18:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366487585] [2025-03-17 12:18:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:18:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:30,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:18:30,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:18:30,056 INFO L87 Difference]: Start difference. First operand has 84 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 80 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:18:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:30,124 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2025-03-17 12:18:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:18:30,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 12:18:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:30,130 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:18:30,131 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:18:30,132 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-17 12:18:30,134 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:30,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:18:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 12:18:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-03-17 12:18:30,158 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 6 [2025-03-17 12:18:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:30,158 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-03-17 12:18:30,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:18:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-03-17 12:18:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:18:30,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:30,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 12:18:30,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:18:30,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:30,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash -893244265, now seen corresponding path program 1 times [2025-03-17 12:18:30,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:30,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538104419] [2025-03-17 12:18:30,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:30,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:18:30,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:18:30,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:30,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:30,279 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-17 12:18:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538104419] [2025-03-17 12:18:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538104419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:18:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401643905] [2025-03-17 12:18:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:30,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:18:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:30,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:18:30,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:18:30,282 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:18:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:30,328 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-17 12:18:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:18:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 12:18:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:30,331 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:18:30,332 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:18:30,332 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-17 12:18:30,333 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:30,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:18:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:18:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 12:18:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 72 states have internal predecessors, (78), 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-17 12:18:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-03-17 12:18:30,339 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 6 [2025-03-17 12:18:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:30,339 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-03-17 12:18:30,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:18:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-03-17 12:18:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:18:30,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:30,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:30,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:18:30,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:30,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 680832439, now seen corresponding path program 1 times [2025-03-17 12:18:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:30,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763695185] [2025-03-17 12:18:30,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:30,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:18:30,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:18:30,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:30,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:30,427 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-17 12:18:30,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:30,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763695185] [2025-03-17 12:18:30,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763695185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:30,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:30,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:18:30,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397173220] [2025-03-17 12:18:30,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:30,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:18:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:30,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:18:30,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:18:30,431 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-17 12:18:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:30,546 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-03-17 12:18:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:18:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-03-17 12:18:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:30,547 INFO L225 Difference]: With dead ends: 75 [2025-03-17 12:18:30,547 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 12:18:30,547 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-17 12:18:30,547 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 242 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 12:18:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 12:18:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.75) internal successors, (77), 71 states have internal predecessors, (77), 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-17 12:18:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-03-17 12:18:30,555 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 12 [2025-03-17 12:18:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:30,556 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-03-17 12:18:30,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-17 12:18:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-03-17 12:18:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:18:30,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:30,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:30,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:18:30,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:30,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash 680832440, now seen corresponding path program 1 times [2025-03-17 12:18:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:30,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389624905] [2025-03-17 12:18:30,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:30,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:18:30,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:18:30,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:30,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:30,711 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-17 12:18:30,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389624905] [2025-03-17 12:18:30,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389624905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:30,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:30,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:18:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325407363] [2025-03-17 12:18:30,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:30,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:18:30,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:30,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:18:30,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:18:30,714 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-17 12:18:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:30,807 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2025-03-17 12:18:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:18:30,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-03-17 12:18:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:30,808 INFO L225 Difference]: With dead ends: 74 [2025-03-17 12:18:30,809 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 12:18:30,809 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-17 12:18:30,810 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:30,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 258 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 12:18:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 12:18:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 70 states have internal predecessors, (76), 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-17 12:18:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-03-17 12:18:30,817 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 12 [2025-03-17 12:18:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:30,817 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-03-17 12:18:30,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-17 12:18:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-03-17 12:18:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:18:30,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:30,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:30,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:18:30,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash 767614928, now seen corresponding path program 1 times [2025-03-17 12:18:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811592613] [2025-03-17 12:18:30,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:30,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:30,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:18:30,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:18:30,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:30,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:30,888 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-17 12:18:30,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811592613] [2025-03-17 12:18:30,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811592613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:30,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:30,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:18:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371942159] [2025-03-17 12:18:30,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:30,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:18:30,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:30,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:18:30,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:18:30,890 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-17 12:18:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:30,899 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2025-03-17 12:18:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:18:30,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-03-17 12:18:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:30,901 INFO L225 Difference]: With dead ends: 79 [2025-03-17 12:18:30,901 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 12:18:30,902 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-17 12:18:30,902 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:30,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:18:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 12:18:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2025-03-17 12:18:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.711111111111111) internal successors, (77), 71 states have internal predecessors, (77), 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-17 12:18:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-03-17 12:18:30,906 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 12 [2025-03-17 12:18:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:30,906 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-03-17 12:18:30,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-17 12:18:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-03-17 12:18:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:18:30,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:30,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:30,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:18:30,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:30,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash 276963436, now seen corresponding path program 1 times [2025-03-17 12:18:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561905603] [2025-03-17 12:18:30,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:30,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:18:30,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:18:30,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:30,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:31,010 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-17 12:18:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:31,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561905603] [2025-03-17 12:18:31,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561905603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:31,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509884123] [2025-03-17 12:18:31,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:31,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:31,013 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-17 12:18:31,015 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-17 12:18:31,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:18:31,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:18:31,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:31,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:31,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:18:31,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:31,142 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-17 12:18:31,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:31,171 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-17 12:18:31,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509884123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:18:31,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:18:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-17 12:18:31,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585076146] [2025-03-17 12:18:31,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:31,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:18:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:31,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:18:31,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:18:31,174 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-17 12:18:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:31,191 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2025-03-17 12:18:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:18:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 24 [2025-03-17 12:18:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:31,192 INFO L225 Difference]: With dead ends: 80 [2025-03-17 12:18:31,192 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:18:31,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 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-17 12:18:31,193 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 226 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-17 12:18:31,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 226 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:18:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:18:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 12:18:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.653061224489796) internal successors, (81), 75 states have internal predecessors, (81), 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-17 12:18:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2025-03-17 12:18:31,196 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 24 [2025-03-17 12:18:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:31,196 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2025-03-17 12:18:31,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-17 12:18:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2025-03-17 12:18:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:18:31,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:31,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:31,204 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-17 12:18:31,402 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-17 12:18:31,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:31,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -214214904, now seen corresponding path program 2 times [2025-03-17 12:18:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331415398] [2025-03-17 12:18:31,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:18:31,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:31,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 12:18:31,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:18:31,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:18:31,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:31,951 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-17 12:18:31,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:31,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331415398] [2025-03-17 12:18:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331415398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:31,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225077085] [2025-03-17 12:18:31,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:18:31,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:31,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:31,954 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-17 12:18:31,956 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-17 12:18:32,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 12:18:32,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:18:32,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:18:32,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:32,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 12:18:32,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:32,095 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-17 12:18:32,113 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-17 12:18:32,158 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:18:32,158 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 14 treesize of output 13 [2025-03-17 12:18:32,238 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-17 12:18:32,255 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-03-17 12:18:32,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:32,309 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-17 12:18:32,356 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-17 12:18:32,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:32,409 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-17 12:18:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 12 not checked. [2025-03-17 12:18:32,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:32,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225077085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:32,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:32,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-03-17 12:18:32,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227022795] [2025-03-17 12:18:32,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:32,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:18:32,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:32,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:18:32,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2025-03-17 12:18:32,473 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:18:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:32,815 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2025-03-17 12:18:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:18:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 36 [2025-03-17 12:18:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:32,816 INFO L225 Difference]: With dead ends: 86 [2025-03-17 12:18:32,816 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 12:18:32,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=346, Unknown=1, NotChecked=38, Total=462 [2025-03-17 12:18:32,817 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 170 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:32,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 398 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 444 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2025-03-17 12:18:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 12:18:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2025-03-17 12:18:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 70 states have internal predecessors, (76), 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-17 12:18:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-03-17 12:18:32,820 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 36 [2025-03-17 12:18:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:32,821 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-03-17 12:18:32,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:18:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-03-17 12:18:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:18:32,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:32,822 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:32,828 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-17 12:18:33,022 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-17 12:18:33,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:33,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:33,023 INFO L85 PathProgramCache]: Analyzing trace with hash -214214903, now seen corresponding path program 1 times [2025-03-17 12:18:33,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:33,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314481005] [2025-03-17 12:18:33,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:33,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:33,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:18:33,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:18:33,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:33,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:18:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:33,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314481005] [2025-03-17 12:18:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314481005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:33,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100874355] [2025-03-17 12:18:33,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:33,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:33,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:33,470 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-17 12:18:33,471 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-17 12:18:33,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:18:33,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:18:33,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:33,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:33,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 12:18:33,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:33,617 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-17 12:18:33,628 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-17 12:18:33,636 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-17 12:18:33,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:33,673 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-17 12:18:33,701 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-17 12:18:33,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:33,740 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-17 12:18:33,774 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-17 12:18:33,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:33,819 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-17 12:18:33,824 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-17 12:18:33,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:18:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100874355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:33,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:18:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 12:18:33,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116232086] [2025-03-17 12:18:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:33,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:18:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:33,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:18:33,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-03-17 12:18:33,827 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-17 12:18:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:33,902 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-03-17 12:18:33,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:18:33,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 36 [2025-03-17 12:18:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:33,903 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:18:33,903 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:18:33,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:18:33,904 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:33,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 209 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2025-03-17 12:18:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:18:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 12:18:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.489795918367347) internal successors, (73), 67 states have internal predecessors, (73), 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-17 12:18:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-03-17 12:18:33,910 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 36 [2025-03-17 12:18:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:33,911 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-03-17 12:18:33,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-17 12:18:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-03-17 12:18:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:18:33,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:33,912 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] [2025-03-17 12:18:33,918 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-17 12:18:34,112 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-17 12:18:34,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:34,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1473061693, now seen corresponding path program 1 times [2025-03-17 12:18:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586304771] [2025-03-17 12:18:34,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:34,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:34,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:18:34,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:18:34,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:34,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:18:34,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586304771] [2025-03-17 12:18:34,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586304771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735571535] [2025-03-17 12:18:34,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:34,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:34,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:34,283 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-17 12:18:34,284 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-17 12:18:34,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:18:34,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:18:34,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:34,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 12:18:34,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:34,391 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-17 12:18:34,395 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-17 12:18:34,422 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-17 12:18:34,425 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-17 12:18:34,439 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-17 12:18:34,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:34,464 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-17 12:18:34,474 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:18:34,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:18:34,513 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-17 12:18:34,527 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-17 12:18:34,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:34,573 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-17 12:18:34,596 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-17 12:18:34,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:34,624 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-17 12:18:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2025-03-17 12:18:34,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:34,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735571535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:34,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:34,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 16 [2025-03-17 12:18:34,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149738631] [2025-03-17 12:18:34,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:34,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:18:34,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:34,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:18:34,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=203, Unknown=2, NotChecked=58, Total=306 [2025-03-17 12:18:34,754 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:18:34,774 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 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|)))) (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-17 12:18:34,778 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 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|)))) (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-17 12:18:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:34,983 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2025-03-17 12:18:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:18:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-03-17 12:18:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:34,984 INFO L225 Difference]: With dead ends: 69 [2025-03-17 12:18:34,984 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 12:18:34,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=386, Unknown=4, NotChecked=172, Total=650 [2025-03-17 12:18:34,985 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:34,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 464 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 222 Unchecked, 0.1s Time] [2025-03-17 12:18:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 12:18:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 12:18:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.4375) internal successors, (69), 64 states have internal predecessors, (69), 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-17 12:18:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2025-03-17 12:18:34,990 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 40 [2025-03-17 12:18:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:34,990 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2025-03-17 12:18:34,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:18:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2025-03-17 12:18:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:18:34,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:34,990 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] [2025-03-17 12:18:34,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:18:35,191 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-17 12:18:35,191 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:35,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1472476799, now seen corresponding path program 1 times [2025-03-17 12:18:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:35,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950010024] [2025-03-17 12:18:35,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:35,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:18:35,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:18:35,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:35,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:18:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950010024] [2025-03-17 12:18:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950010024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493988823] [2025-03-17 12:18:35,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:35,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:35,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:35,450 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-17 12:18:35,451 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-17 12:18:35,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:18:35,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:18:35,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:35,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:35,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 12:18:35,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:35,683 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-17 12:18:35,768 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-17 12:18:35,772 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-17 12:18:35,792 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 12:18:35,792 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 16 treesize of output 18 [2025-03-17 12:18:35,820 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-17 12:18:35,826 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-17 12:18:35,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:35,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 12:18:35,945 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-17 12:18:35,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493988823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:18:35,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:18:35,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 20 [2025-03-17 12:18:35,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155632326] [2025-03-17 12:18:35,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:35,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 12:18:35,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:35,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 12:18:35,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2025-03-17 12:18:35,946 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 21 states, 20 states have (on average 2.9) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-17 12:18:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:36,240 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-03-17 12:18:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:18:36,241 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2025-03-17 12:18:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:36,242 INFO L225 Difference]: With dead ends: 68 [2025-03-17 12:18:36,242 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 12:18:36,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=567, Unknown=1, NotChecked=48, Total=702 [2025-03-17 12:18:36,243 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:36,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 494 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 533 Invalid, 0 Unknown, 67 Unchecked, 0.2s Time] [2025-03-17 12:18:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 12:18:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 12:18:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 63 states have internal predecessors, (69), 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-17 12:18:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2025-03-17 12:18:36,249 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 40 [2025-03-17 12:18:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:36,249 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2025-03-17 12:18:36,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-17 12:18:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2025-03-17 12:18:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:18:36,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:36,250 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] [2025-03-17 12:18:36,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:18:36,454 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-17 12:18:36,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:36,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:36,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1472476798, now seen corresponding path program 1 times [2025-03-17 12:18:36,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:36,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819090119] [2025-03-17 12:18:36,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:36,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:36,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:18:36,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:18:36,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:36,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:36,814 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-17 12:18:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819090119] [2025-03-17 12:18:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819090119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220880098] [2025-03-17 12:18:36,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:36,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:36,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:36,818 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-17 12:18:36,819 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-17 12:18:36,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:18:36,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:18:36,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:36,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-17 12:18:36,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:36,960 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-17 12:18:37,109 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-17 12:18:37,111 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-17 12:18:37,146 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-03-17 12:18:37,185 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:18:37,185 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-17 12:18:37,189 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-17 12:18:37,239 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-17 12:18:37,245 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-17 12:18:37,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:37,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220880098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:37,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2025-03-17 12:18:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819186908] [2025-03-17 12:18:37,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:37,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 12:18:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:37,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 12:18:37,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=678, Unknown=1, NotChecked=52, Total=812 [2025-03-17 12:18:37,422 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 25 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 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-17 12:18:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:37,897 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-03-17 12:18:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:18:37,898 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 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 40 [2025-03-17 12:18:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:37,898 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:18:37,899 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:18:37,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1199, Unknown=1, NotChecked=70, Total=1406 [2025-03-17 12:18:37,900 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:37,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 546 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 590 Invalid, 0 Unknown, 74 Unchecked, 0.3s Time] [2025-03-17 12:18:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:18:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 12:18:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 72 states have internal predecessors, (78), 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-17 12:18:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-03-17 12:18:37,902 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 40 [2025-03-17 12:18:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:37,903 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-03-17 12:18:37,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 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-17 12:18:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-03-17 12:18:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:18:37,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:37,903 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] [2025-03-17 12:18:37,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:18:38,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:38,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:38,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash 710386948, now seen corresponding path program 1 times [2025-03-17 12:18:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:38,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830330882] [2025-03-17 12:18:38,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:38,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:18:38,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:18:38,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:18:38,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:38,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830330882] [2025-03-17 12:18:38,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830330882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:38,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910871502] [2025-03-17 12:18:38,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:38,958 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-17 12:18:38,960 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-17 12:18:39,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:18:39,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:18:39,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:39,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:39,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-17 12:18:39,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:39,307 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:18:39,307 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-17 12:18:39,367 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-17 12:18:39,466 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 13 treesize of output 5 [2025-03-17 12:18:39,469 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:18:39,470 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 7 [2025-03-17 12:18:39,600 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2025-03-17 12:18:39,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:39,628 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 22 treesize of output 17 [2025-03-17 12:18:39,655 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2025-03-17 12:18:39,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2025-03-17 12:18:39,757 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-17 12:18:39,884 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 25 treesize of output 13 [2025-03-17 12:18:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-17 12:18:39,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910871502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:40,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:40,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2025-03-17 12:18:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675913961] [2025-03-17 12:18:40,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:40,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-17 12:18:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:40,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-17 12:18:40,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2369, Unknown=1, NotChecked=98, Total=2652 [2025-03-17 12:18:40,160 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 47 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:18:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:41,011 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2025-03-17 12:18:41,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 12:18:41,012 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2025-03-17 12:18:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:41,012 INFO L225 Difference]: With dead ends: 86 [2025-03-17 12:18:41,013 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 12:18:41,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=324, Invalid=4101, Unknown=1, NotChecked=130, Total=4556 [2025-03-17 12:18:41,014 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 64 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:41,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 810 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1050 Invalid, 0 Unknown, 94 Unchecked, 0.5s Time] [2025-03-17 12:18:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 12:18:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2025-03-17 12:18:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.35) internal successors, (81), 74 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-17 12:18:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2025-03-17 12:18:41,016 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 44 [2025-03-17 12:18:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:41,016 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2025-03-17 12:18:41,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:18:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2025-03-17 12:18:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:18:41,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:41,017 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] [2025-03-17 12:18:41,024 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-17 12:18:41,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:41,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:41,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:41,218 INFO L85 PathProgramCache]: Analyzing trace with hash 710386949, now seen corresponding path program 1 times [2025-03-17 12:18:41,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:41,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553675415] [2025-03-17 12:18:41,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:41,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:41,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:18:41,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:18:41,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:41,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:18:42,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:42,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553675415] [2025-03-17 12:18:42,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553675415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:42,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786363403] [2025-03-17 12:18:42,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:42,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:42,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:42,384 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-17 12:18:42,385 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-17 12:18:42,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:18:42,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:18:42,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:42,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:42,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-17 12:18:42,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:42,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:18:42,780 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-17 12:18:42,821 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 23 treesize of output 11 [2025-03-17 12:18:42,877 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:18:42,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:18:42,896 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:18:42,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2025-03-17 12:18:42,999 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 23 treesize of output 3 [2025-03-17 12:18:43,006 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-17 12:18:43,168 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 55 treesize of output 23 [2025-03-17 12:18:43,171 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 11 treesize of output 3 [2025-03-17 12:18:43,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-17 12:18:43,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2025-03-17 12:18:43,359 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-03-17 12:18:43,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:43,389 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 63 treesize of output 40 [2025-03-17 12:18:43,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:43,394 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 22 treesize of output 17 [2025-03-17 12:18:43,405 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-17 12:18:43,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 12:18:43,410 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 20 treesize of output 15 [2025-03-17 12:18:43,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2025-03-17 12:18:43,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-17 12:18:43,652 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-17 12:18:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-17 12:18:43,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:44,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786363403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:44,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:44,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2025-03-17 12:18:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234772805] [2025-03-17 12:18:44,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:44,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 12:18:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:44,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 12:18:44,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2930, Unknown=1, NotChecked=108, Total=3192 [2025-03-17 12:18:44,073 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 51 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 44 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:18:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:46,023 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2025-03-17 12:18:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 12:18:46,023 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 44 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2025-03-17 12:18:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:46,024 INFO L225 Difference]: With dead ends: 86 [2025-03-17 12:18:46,024 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 12:18:46,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=345, Invalid=5510, Unknown=1, NotChecked=150, Total=6006 [2025-03-17 12:18:46,025 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 68 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:46,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1426 Invalid, 2284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2180 Invalid, 0 Unknown, 91 Unchecked, 1.0s Time] [2025-03-17 12:18:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 12:18:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-17 12:18:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 76 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-17 12:18:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-03-17 12:18:46,029 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 44 [2025-03-17 12:18:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:46,030 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-03-17 12:18:46,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 44 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:18:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-03-17 12:18:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:18:46,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:46,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:46,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 12:18:46,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 12:18:46,233 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:46,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:46,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1011091207, now seen corresponding path program 2 times [2025-03-17 12:18:46,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:46,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888270355] [2025-03-17 12:18:46,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:18:46,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:46,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 12:18:46,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:18:46,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:18:46,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:18:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888270355] [2025-03-17 12:18:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888270355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841439307] [2025-03-17 12:18:47,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:18:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:47,492 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-17 12:18:47,493 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-17 12:18:47,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 12:18:47,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:18:47,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:18:47,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:47,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-03-17 12:18:47,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:47,639 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-17 12:18:47,719 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-17 12:18:47,722 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-17 12:18:47,912 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:18:47,912 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 14 treesize of output 13 [2025-03-17 12:18:47,921 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:18:47,922 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 16 treesize of output 15 [2025-03-17 12:18:47,932 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:18:47,932 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 16 treesize of output 15 [2025-03-17 12:18:48,033 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-03-17 12:18:48,033 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 31 treesize of output 38 [2025-03-17 12:18:48,056 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-17 12:18:48,056 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 35 treesize of output 31 [2025-03-17 12:18:48,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:18:48,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 39 [2025-03-17 12:18:48,230 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:18:48,231 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 7 [2025-03-17 12:18:48,236 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:18:48,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 12:18:48,416 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2025-03-17 12:18:48,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:48,447 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-17 12:18:48,447 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2025-03-17 12:18:48,476 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2025-03-17 12:18:48,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2025-03-17 12:18:48,487 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-03-17 12:18:48,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2025-03-17 12:18:48,633 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 107 treesize of output 67 [2025-03-17 12:18:49,091 INFO L349 Elim1Store]: treesize reduction 20, result has 67.2 percent of original size [2025-03-17 12:18:49,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 137 [2025-03-17 12:18:49,438 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:18:49,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 22 [2025-03-17 12:18:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-17 12:18:49,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841439307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:50,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 54 [2025-03-17 12:18:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349528562] [2025-03-17 12:18:50,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:50,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-17 12:18:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:50,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-17 12:18:50,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3710, Unknown=1, NotChecked=122, Total=4032 [2025-03-17 12:18:50,184 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 54 states, 52 states have (on average 1.5) internal successors, (78), 47 states have internal predecessors, (78), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:18:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:51,973 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2025-03-17 12:18:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 12:18:51,973 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.5) internal successors, (78), 47 states have internal predecessors, (78), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-03-17 12:18:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:51,974 INFO L225 Difference]: With dead ends: 111 [2025-03-17 12:18:51,974 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 12:18:51,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=320, Invalid=5845, Unknown=1, NotChecked=154, Total=6320 [2025-03-17 12:18:51,976 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:51,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1473 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1909 Invalid, 0 Unknown, 103 Unchecked, 1.0s Time] [2025-03-17 12:18:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 12:18:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2025-03-17 12:18:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 97 states have internal predecessors, (106), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:18:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2025-03-17 12:18:51,979 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 48 [2025-03-17 12:18:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2025-03-17 12:18:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.5) internal successors, (78), 47 states have internal predecessors, (78), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:18:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2025-03-17 12:18:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:18:51,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:51,979 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-17 12:18:51,989 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-17 12:18:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 12:18:52,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:52,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash -924973200, now seen corresponding path program 1 times [2025-03-17 12:18:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885915795] [2025-03-17 12:18:52,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:52,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:18:52,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:18:52,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:52,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:52,292 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-17 12:18:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885915795] [2025-03-17 12:18:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885915795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:52,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:52,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:18:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709171081] [2025-03-17 12:18:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:52,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:18:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:52,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:18:52,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:18:52,294 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-17 12:18:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:52,378 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2025-03-17 12:18:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:18:52,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-17 12:18:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:52,379 INFO L225 Difference]: With dead ends: 108 [2025-03-17 12:18:52,379 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 12:18:52,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:18:52,379 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:52,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 261 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 12:18:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-17 12:18:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 98 states have internal predecessors, (109), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:18:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2025-03-17 12:18:52,383 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 48 [2025-03-17 12:18:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:52,383 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2025-03-17 12:18:52,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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-17 12:18:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2025-03-17 12:18:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:18:52,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:52,384 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-17 12:18:52,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:18:52,384 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:52,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash -924973199, now seen corresponding path program 1 times [2025-03-17 12:18:52,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003497878] [2025-03-17 12:18:52,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:52,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:18:52,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:18:52,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:52,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:18:52,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:52,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003497878] [2025-03-17 12:18:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003497878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:52,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466027056] [2025-03-17 12:18:52,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:52,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:52,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:52,631 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-17 12:18:52,632 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-17 12:18:52,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:18:52,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:18:52,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:52,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:52,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 12:18:52,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:52,767 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-17 12:18:52,886 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-17 12:18:52,888 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-17 12:18:52,912 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16| Int)) (= 0 (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_16|)))) is different from true [2025-03-17 12:18:52,934 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:18:52,934 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-17 12:18:52,940 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-17 12:18:53,007 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-17 12:18:53,039 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-17 12:18:53,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:53,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466027056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:53,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2025-03-17 12:18:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173298724] [2025-03-17 12:18:53,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:53,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 12:18:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:53,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 12:18:53,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=735, Unknown=1, NotChecked=54, Total=870 [2025-03-17 12:18:53,160 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 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-17 12:18:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:53,531 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2025-03-17 12:18:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 12:18:53,532 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 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 48 [2025-03-17 12:18:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:53,532 INFO L225 Difference]: With dead ends: 110 [2025-03-17 12:18:53,532 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 12:18:53,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1407, Unknown=1, NotChecked=76, Total=1640 [2025-03-17 12:18:53,533 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 47 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:53,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 610 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 702 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2025-03-17 12:18:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 12:18:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 12:18:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.264367816091954) internal successors, (110), 100 states have internal predecessors, (110), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:18:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2025-03-17 12:18:53,535 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 48 [2025-03-17 12:18:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:53,535 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2025-03-17 12:18:53,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 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-17 12:18:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2025-03-17 12:18:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:18:53,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:53,536 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-17 12:18:53,543 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-17 12:18:53,740 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,SelfDestructingSolverStorable15 [2025-03-17 12:18:53,740 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:18:53,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash 634144868, now seen corresponding path program 1 times [2025-03-17 12:18:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:53,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938150581] [2025-03-17 12:18:53,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:53,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:18:53,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:18:53,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:53,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:18:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938150581] [2025-03-17 12:18:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938150581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902999128] [2025-03-17 12:18:53,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:53,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:53,831 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-17 12:18:53,833 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-17 12:18:53,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:18:53,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:18:53,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:53,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:53,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:18:53,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:54,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 12:18:54,024 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-17 12:18:54,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:18:54,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902999128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:18:54,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:18:54,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 11 [2025-03-17 12:18:54,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694296804] [2025-03-17 12:18:54,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:54,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:18:54,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:54,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:18:54,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:18:54,060 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:18:58,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:02,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:06,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:10,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:10,188 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2025-03-17 12:19:10,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:19:10,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2025-03-17 12:19:10,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:10,189 INFO L225 Difference]: With dead ends: 109 [2025-03-17 12:19:10,189 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 12:19:10,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:19:10,189 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 76 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:10,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 430 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-03-17 12:19:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 12:19:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 12:19:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 100 states have internal predecessors, (109), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:19:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2025-03-17 12:19:10,192 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 51 [2025-03-17 12:19:10,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:10,192 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2025-03-17 12:19:10,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:19:10,192 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2025-03-17 12:19:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 12:19:10,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:10,193 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] [2025-03-17 12:19:10,200 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-17 12:19:10,397 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,SelfDestructingSolverStorable16 [2025-03-17 12:19:10,397 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:19:10,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:10,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1017106188, now seen corresponding path program 1 times [2025-03-17 12:19:10,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:10,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785492606] [2025-03-17 12:19:10,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:10,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:10,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:19:10,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:19:10,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:10,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:19:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:10,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785492606] [2025-03-17 12:19:10,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785492606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:10,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457369601] [2025-03-17 12:19:10,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:10,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:10,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:10,897 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-17 12:19:10,898 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-17 12:19:10,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:19:11,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:19:11,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:11,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:11,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-17 12:19:11,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:11,113 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:19:11,114 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 14 treesize of output 13 [2025-03-17 12:19:11,149 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 19 treesize of output 1 [2025-03-17 12:19:11,216 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 19 treesize of output 5 [2025-03-17 12:19:11,219 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:19:11,219 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 7 [2025-03-17 12:19:11,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:11,349 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 28 treesize of output 23 [2025-03-17 12:19:11,374 INFO L349 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2025-03-17 12:19:11,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 69 [2025-03-17 12:19:11,497 INFO L349 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2025-03-17 12:19:11,498 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 63 treesize of output 49 [2025-03-17 12:19:11,616 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 152 treesize of output 116 [2025-03-17 12:19:11,619 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 115 treesize of output 91 [2025-03-17 12:19:11,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:11,773 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 97 treesize of output 55 [2025-03-17 12:19:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:11,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:12,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457369601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:12,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:19:12,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 42 [2025-03-17 12:19:12,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482431940] [2025-03-17 12:19:12,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:12,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 12:19:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:12,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 12:19:12,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 12:19:12,305 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 43 states, 40 states have (on average 2.05) internal successors, (82), 37 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:19:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:13,492 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2025-03-17 12:19:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 12:19:13,492 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.05) internal successors, (82), 37 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 53 [2025-03-17 12:19:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:13,493 INFO L225 Difference]: With dead ends: 117 [2025-03-17 12:19:13,493 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 12:19:13,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=385, Invalid=5315, Unknown=0, NotChecked=0, Total=5700 [2025-03-17 12:19:13,494 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 150 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:13,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 885 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:19:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 12:19:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2025-03-17 12:19:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 103 states have internal predecessors, (115), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:19:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2025-03-17 12:19:13,497 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 53 [2025-03-17 12:19:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:13,497 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2025-03-17 12:19:13,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.05) internal successors, (82), 37 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:19:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2025-03-17 12:19:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 12:19:13,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:13,497 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] [2025-03-17 12:19:13,506 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-17 12:19:13,699 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,SelfDestructingSolverStorable17 [2025-03-17 12:19:13,700 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:19:13,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1017106187, now seen corresponding path program 1 times [2025-03-17 12:19:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392597498] [2025-03-17 12:19:13,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:13,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:19:13,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:19:13,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:13,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:19:14,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:14,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392597498] [2025-03-17 12:19:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392597498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:14,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545738131] [2025-03-17 12:19:14,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:14,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:14,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:14,193 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-17 12:19:14,194 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-17 12:19:14,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:19:14,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:19:14,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:14,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:14,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-17 12:19:14,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:14,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:19:14,561 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:19:14,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2025-03-17 12:19:14,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:19:14,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:19:14,628 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-17 12:19:14,747 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 79 treesize of output 23 [2025-03-17 12:19:14,749 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-17 12:19:14,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-17 12:19:14,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2025-03-17 12:19:23,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:23,004 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 87 treesize of output 64 [2025-03-17 12:19:23,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:23,012 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-17 12:19:23,029 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-03-17 12:19:23,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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-17 12:19:23,034 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 26 treesize of output 21 [2025-03-17 12:19:23,285 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2025-03-17 12:19:23,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 88 treesize of output 55 [2025-03-17 12:19:23,297 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2025-03-17 12:19:23,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 33 [2025-03-17 12:19:23,414 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 121 treesize of output 93 [2025-03-17 12:19:23,418 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 97 treesize of output 73 [2025-03-17 12:19:23,605 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 41 treesize of output 17 [2025-03-17 12:19:23,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:23,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 39 treesize of output 57 [2025-03-17 12:19:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:23,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545738131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:24,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:19:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 30] total 52 [2025-03-17 12:19:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271293403] [2025-03-17 12:19:24,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:24,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 12:19:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:24,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 12:19:24,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3713, Unknown=2, NotChecked=0, Total=3906 [2025-03-17 12:19:24,880 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 52 states, 50 states have (on average 1.82) internal successors, (91), 44 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:19:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:26,947 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2025-03-17 12:19:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 12:19:26,947 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.82) internal successors, (91), 44 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2025-03-17 12:19:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:26,948 INFO L225 Difference]: With dead ends: 118 [2025-03-17 12:19:26,948 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 12:19:26,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=472, Invalid=7358, Unknown=2, NotChecked=0, Total=7832 [2025-03-17 12:19:26,950 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 107 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:26,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 979 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 12:19:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 12:19:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-03-17 12:19:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 105 states have internal predecessors, (113), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:19:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-03-17 12:19:26,952 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 53 [2025-03-17 12:19:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:26,952 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-03-17 12:19:26,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.82) internal successors, (91), 44 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:19:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-03-17 12:19:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 12:19:26,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:26,953 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, 1, 1] [2025-03-17 12:19:26,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 12:19:27,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:27,157 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:19:27,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1901297834, now seen corresponding path program 1 times [2025-03-17 12:19:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029876407] [2025-03-17 12:19:27,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:27,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 12:19:27,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 12:19:27,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:27,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:19:28,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:28,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029876407] [2025-03-17 12:19:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029876407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:28,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940698003] [2025-03-17 12:19:28,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:28,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:28,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:28,124 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-17 12:19:28,125 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-17 12:19:28,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 12:19:28,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 12:19:28,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:28,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:28,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-17 12:19:28,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:28,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-17 12:19:28,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:19:28,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:19:28,613 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:19:28,613 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-17 12:19:28,624 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-17 12:19:28,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2025-03-17 12:19:28,794 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-17 12:19:28,796 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-17 12:19:28,950 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2025-03-17 12:19:28,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:28,985 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 31 treesize of output 26 [2025-03-17 12:19:28,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:28,990 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-17 12:19:28,996 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:19:28,997 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-17 12:19:29,297 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 40 treesize of output 12 [2025-03-17 12:19:29,455 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-17 12:19:29,534 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-17 12:19:29,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:29,540 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-17 12:19:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-03-17 12:19:29,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940698003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:30,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:19:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27] total 57 [2025-03-17 12:19:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885571380] [2025-03-17 12:19:30,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:30,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-17 12:19:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:30,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-17 12:19:30,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3953, Unknown=12, NotChecked=126, Total=4290 [2025-03-17 12:19:30,281 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 57 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 51 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:19:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:32,526 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2025-03-17 12:19:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 12:19:32,526 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 51 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2025-03-17 12:19:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:32,527 INFO L225 Difference]: With dead ends: 141 [2025-03-17 12:19:32,527 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 12:19:32,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=457, Invalid=8277, Unknown=12, NotChecked=184, Total=8930 [2025-03-17 12:19:32,529 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 73 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:32,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1548 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1642 Invalid, 0 Unknown, 111 Unchecked, 0.9s Time] [2025-03-17 12:19:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 12:19:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2025-03-17 12:19:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 114 states have internal predecessors, (122), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:19:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2025-03-17 12:19:32,531 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 58 [2025-03-17 12:19:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:32,531 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2025-03-17 12:19:32,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 51 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:19:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2025-03-17 12:19:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 12:19:32,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:32,532 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:32,540 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-17 12:19:32,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:32,732 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:19:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2119554653, now seen corresponding path program 3 times [2025-03-17 12:19:32,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:32,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361003500] [2025-03-17 12:19:32,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:19:32,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:32,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 4 equivalence classes. [2025-03-17 12:19:32,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 12:19:32,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 12:19:32,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 12:19:32,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:32,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361003500] [2025-03-17 12:19:32,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361003500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:32,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:32,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:19:32,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95722283] [2025-03-17 12:19:32,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:32,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:19:32,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:32,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:19:32,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:19:32,799 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:19:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:32,812 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2025-03-17 12:19:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:19:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2025-03-17 12:19:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:32,814 INFO L225 Difference]: With dead ends: 80 [2025-03-17 12:19:32,814 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:19:32,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:19:32,816 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:32,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:19:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:19:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 12:19:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 74 states have internal predecessors, (77), 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-17 12:19:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-03-17 12:19:32,818 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 60 [2025-03-17 12:19:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-03-17 12:19:32,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:19:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-03-17 12:19:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 12:19:32,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:32,819 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:32,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:19:32,819 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2025-03-17 12:19:32,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 859470515, now seen corresponding path program 1 times [2025-03-17 12:19:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:32,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450389133] [2025-03-17 12:19:32,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:32,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 12:19:32,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 12:19:32,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:32,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450389133] [2025-03-17 12:19:34,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450389133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743936392] [2025-03-17 12:19:34,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:34,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:34,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:34,220 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-17 12:19:34,220 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-17 12:19:34,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 12:19:34,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 12:19:34,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:34,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:34,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-03-17 12:19:34,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:34,413 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-17 12:19:34,416 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-17 12:19:34,568 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-17 12:19:34,572 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-17 12:19:34,899 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:19:34,899 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 16 treesize of output 15 [2025-03-17 12:19:34,910 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-03-17 12:19:34,910 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 18 [2025-03-17 12:19:34,928 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:19:34,928 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-17 12:19:34,933 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 16 treesize of output 11 [2025-03-17 12:19:35,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:19:35,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:19:35,347 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:19:35,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 32 [2025-03-17 12:19:35,353 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-17 12:19:35,357 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-17 12:19:35,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 12:19:35,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:35,904 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-17 12:19:35,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 57 [2025-03-17 12:19:35,933 INFO L349 Elim1Store]: treesize reduction 60, result has 36.8 percent of original size [2025-03-17 12:19:35,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2025-03-17 12:19:35,959 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-03-17 12:19:35,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 49 [2025-03-17 12:19:35,988 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-03-17 12:19:35,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2025-03-17 12:19:36,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:36,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2025-03-17 12:19:37,049 INFO L349 Elim1Store]: treesize reduction 176, result has 37.4 percent of original size [2025-03-17 12:19:37,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 234 treesize of output 250 [2025-03-17 12:19:37,100 INFO L349 Elim1Store]: treesize reduction 112, result has 37.1 percent of original size [2025-03-17 12:19:37,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 130 [2025-03-17 12:19:39,901 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 1391 treesize of output 1147